On the dominating induced matching problem:spectral results and sharp bounds

Detalhes bibliográficos
Autor(a) principal: Andrade, Enide
Data de Publicação: 2018
Outros Autores: Cardoso, Domingos M., Medina, Luis, Rojo, Oscar
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/10773/18244
Resumo: A matching M is a dominating induced matching of a graph if every edge is either in M or has a common end-vertex with exactly one edge in M. The extremal graphs on the number of edges with dominating induced matchings are characterized by its Laplacian spectrum and its principal Laplacian eigenvector. Adjacency, Laplacian and signless Laplacian spectral bounds on the cardinality of dominating induced matchings are obtained for arbitrary graphs. Moreover, it is shown that some of these bounds are sharp and examples of graphs attaining the corresponding bounds are given.
id RCAP_7eb78dedbd071211071d5daab4897c70
oai_identifier_str oai:ria.ua.pt:10773/18244
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 On the dominating induced matching problem:spectral results and sharp boundsInduced matchingDominating induced matchingSpectral graph theoryA matching M is a dominating induced matching of a graph if every edge is either in M or has a common end-vertex with exactly one edge in M. The extremal graphs on the number of edges with dominating induced matchings are characterized by its Laplacian spectrum and its principal Laplacian eigenvector. Adjacency, Laplacian and signless Laplacian spectral bounds on the cardinality of dominating induced matchings are obtained for arbitrary graphs. Moreover, it is shown that some of these bounds are sharp and examples of graphs attaining the corresponding bounds are given.Elsevier2018-07-20T14:01:01Z2018-01-01T00:00:00Z20182018-01-01T11:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/18244eng0166-218X10.1016/j.dam.2016.01.012Andrade, EnideCardoso, Domingos M.Medina, LuisRojo, Oscarinfo: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:RCAAP2024-02-22T11:34:36Zoai:ria.ua.pt:10773/18244Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:53:01.109362Repositó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 On the dominating induced matching problem:spectral results and sharp bounds
title On the dominating induced matching problem:spectral results and sharp bounds
spellingShingle On the dominating induced matching problem:spectral results and sharp bounds
Andrade, Enide
Induced matching
Dominating induced matching
Spectral graph theory
title_short On the dominating induced matching problem:spectral results and sharp bounds
title_full On the dominating induced matching problem:spectral results and sharp bounds
title_fullStr On the dominating induced matching problem:spectral results and sharp bounds
title_full_unstemmed On the dominating induced matching problem:spectral results and sharp bounds
title_sort On the dominating induced matching problem:spectral results and sharp bounds
author Andrade, Enide
author_facet Andrade, Enide
Cardoso, Domingos M.
Medina, Luis
Rojo, Oscar
author_role author
author2 Cardoso, Domingos M.
Medina, Luis
Rojo, Oscar
author2_role author
author
author
dc.contributor.author.fl_str_mv Andrade, Enide
Cardoso, Domingos M.
Medina, Luis
Rojo, Oscar
dc.subject.por.fl_str_mv Induced matching
Dominating induced matching
Spectral graph theory
topic Induced matching
Dominating induced matching
Spectral graph theory
description A matching M is a dominating induced matching of a graph if every edge is either in M or has a common end-vertex with exactly one edge in M. The extremal graphs on the number of edges with dominating induced matchings are characterized by its Laplacian spectrum and its principal Laplacian eigenvector. Adjacency, Laplacian and signless Laplacian spectral bounds on the cardinality of dominating induced matchings are obtained for arbitrary graphs. Moreover, it is shown that some of these bounds are sharp and examples of graphs attaining the corresponding bounds are given.
publishDate 2018
dc.date.none.fl_str_mv 2018-07-20T14:01:01Z
2018-01-01T00:00:00Z
2018
2018-01-01T11:00:00Z
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/10773/18244
url http://hdl.handle.net/10773/18244
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0166-218X
10.1016/j.dam.2016.01.012
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_ 1799137580838551552

Registros relacionados