Sciweavers

DAM
2008
147views more  DAM 2008»
13 years 11 months ago
Efficient edge domination in regular graphs
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
Domingos Moreira Cardoso, J. Orestes Cerdeira, Cha...