Please use this identifier to cite or link to this item:
Title: On the dominating induced matching problem: Spectral results and sharp bounds
Author: Andrade, Enide
Cardoso, Domingos M.
Medina, Luis
Rojo, Oscar
Keywords: Induced matching
Dominating induced matching
Spectral Graph Theory
Issue Date: Jan-2018
Publisher: Elsevier
Abstract: A matching M is a dominating induced matching of a graph if every edge is either in M or has a common end-vertex with exactly one edge in M. The extremal graphs on the number of edges with dominating induced matchings are characterized by its Laplacian spectrum and its principal Laplacian eigenvector. Adjacency, Laplacian and signless Laplacian spectral bounds on the cardinality of dominating induced matchings are obtained for arbitrary graphs. Moreover, it is shown that some of these bounds are sharp and examples of graphs attaining the corresponding bounds are given.
Peer review: yes
DOI: 10.1016/j.dam.2016.01.012
ISSN: 0166-218X
Appears in Collections:CIDMA - Artigos

Files in This Item:
File Description SizeFormat 
PublishedVersion.pdfMain article392.15 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.