Please use this identifier to cite or link to this item
|title: ||Efficient edge domination in regular graphs|
|authors: ||Cardoso, Domingos M.|
Orestes Cerdeira, J.
Silva, P. C.
|keywords: ||Domination in graphs|
Spectra of graphs
Edge dominating set
|issue date: ||2008|
|abstract: ||An induced matching of a graph G is a matching having no two edges joined by an edge. An efficient edge dominating set of G is an induced matching M such that every other edge of G is adjacent to some edge in M. We relate maximum induced matchings and efficient edge dominating sets, showing that efficient edge dominating sets are maximum induced matchings, and that maximum induced matchings on regular graphs with efficient edge dominating sets are efficient edge dominating sets. A necessary condition for the existence of efficient edge dominating sets in terms of spectra of graphs is established. We also prove that, for arbitrary fixed p ≥ 3, deciding on the existence of efficient edge dominating sets on p-regular graphs is NP-complete. © 2008 Elsevier B.V. All rights reserved.|
|publisher version/DOI: ||http://www.sciencedirect.com/science/article/pii/S0166218X08000413|
|source: ||Discrete Applied Mathematics|
|appears in collections||MAT - Artigos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.