Efficient edge domination in regular graphs
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 eff...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Language: | eng |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.5/5615 |
| Country: | Portugal |
| Oai: | oai:www.repository.utl.pt:10400.5/5615 |