Encontrado 1 documento, a visualizar página 1 de 1
Ordenado por
Data
ir para a página:
1
Efficient edge domination in regular graphs
Cardoso, Domingos M.; Cerdeira, J.Orestes; Delorme, Charles; Silva, Pedro C.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 wi...
Data: 2008
|
Origem: Repositório da UTL
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||