A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets

Detalhes bibliográficos
Autor(a) principal: Andelic, Milica
Data de Publicação: 2018
Outros Autores: Cardoso, Domingos M., Pereira, António
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/22568
Resumo: A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one $(\kappa,\tau)$-regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching. Furthermore, computational experiments revealed that the introduced lower bound is better than the known ones. The paper also gives sufficient condition for a graph to be non Hamiltonian (or without a perfect matching).
id RCAP_4dcd649c5084087e7b9430faf5196700
oai_identifier_str oai:ria.ua.pt:10773/22568
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 A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular setsSpectral Graph TheorySignless Laplacian IndexHamiltonian GraphsPerfect MatchinA new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one $(\kappa,\tau)$-regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching. Furthermore, computational experiments revealed that the introduced lower bound is better than the known ones. The paper also gives sufficient condition for a graph to be non Hamiltonian (or without a perfect matching).De Gruyter2018-03-08T16:03:21Z2018-03-03T00:00:00Z2018-03-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/22568eng2300-745110.1515/spma-2018-0007Andelic, MilicaCardoso, Domingos M.Pereira, Antónioinfo: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:44:07Zoai:ria.ua.pt:10773/22568Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:56:39.400721Repositó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 A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
title A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
spellingShingle A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
Andelic, Milica
Spectral Graph Theory
Signless Laplacian Index
Hamiltonian Graphs
Perfect Matchin
title_short A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
title_full A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
title_fullStr A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
title_full_unstemmed A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
title_sort A sharp lower bound on the signless Laplacian index of graphs with (k,t)-regular sets
author Andelic, Milica
author_facet Andelic, Milica
Cardoso, Domingos M.
Pereira, António
author_role author
author2 Cardoso, Domingos M.
Pereira, António
author2_role author
author
dc.contributor.author.fl_str_mv Andelic, Milica
Cardoso, Domingos M.
Pereira, António
dc.subject.por.fl_str_mv Spectral Graph Theory
Signless Laplacian Index
Hamiltonian Graphs
Perfect Matchin
topic Spectral Graph Theory
Signless Laplacian Index
Hamiltonian Graphs
Perfect Matchin
description A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one $(\kappa,\tau)$-regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching. Furthermore, computational experiments revealed that the introduced lower bound is better than the known ones. The paper also gives sufficient condition for a graph to be non Hamiltonian (or without a perfect matching).
publishDate 2018
dc.date.none.fl_str_mv 2018-03-08T16:03:21Z
2018-03-03T00:00:00Z
2018-03-03
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/22568
url http://hdl.handle.net/10773/22568
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 2300-7451
10.1515/spma-2018-0007
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 De Gruyter
publisher.none.fl_str_mv De Gruyter
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_ 1799137620118208512

Registros relacionados