Efficient edge domination in regular graphs

Detalhes bibliográficos
Autor(a) principal: Cardoso, Domingos M.
Data de Publicação: 2008
Outros Autores: Cerdeira, J.O., Delorme, Charles, Silva, Pedro C.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10400.5/5615
Resumo: 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
id RCAP_ce8a2fc6cc2488a4d26f36abafdaf7b3
oai_identifier_str oai:www.repository.utl.pt:10400.5/5615
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Efficient edge domination in regular graphsinduced matchingsdomination in graphsregular graphsNP-completenessAn 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-completeElsevierRepositório da Universidade de LisboaCardoso, Domingos M.Cerdeira, J.O.Delorme, CharlesSilva, Pedro C.2013-06-03T15:58:32Z20082008-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.5/5615eng"Discrete Applied Mathematics". ISSN 0166-218X. 156 (2008) 3060-30650166-218Xinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-06T14:36:29Zoai:www.repository.utl.pt:10400.5/5615Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T16:53:05.165451Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Efficient edge domination in regular graphs
title Efficient edge domination in regular graphs
spellingShingle Efficient edge domination in regular graphs
Cardoso, Domingos M.
induced matchings
domination in graphs
regular graphs
NP-completeness
title_short Efficient edge domination in regular graphs
title_full Efficient edge domination in regular graphs
title_fullStr Efficient edge domination in regular graphs
title_full_unstemmed Efficient edge domination in regular graphs
title_sort Efficient edge domination in regular graphs
author Cardoso, Domingos M.
author_facet Cardoso, Domingos M.
Cerdeira, J.O.
Delorme, Charles
Silva, Pedro C.
author_role author
author2 Cerdeira, J.O.
Delorme, Charles
Silva, Pedro C.
author2_role author
author
author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Cardoso, Domingos M.
Cerdeira, J.O.
Delorme, Charles
Silva, Pedro C.
dc.subject.por.fl_str_mv induced matchings
domination in graphs
regular graphs
NP-completeness
topic induced matchings
domination in graphs
regular graphs
NP-completeness
description 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
publishDate 2008
dc.date.none.fl_str_mv 2008
2008-01-01T00:00:00Z
2013-06-03T15:58:32Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.5/5615
url http://hdl.handle.net/10400.5/5615
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv "Discrete Applied Mathematics". ISSN 0166-218X. 156 (2008) 3060-3065
0166-218X
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799131006947557376

Registros relacionados