1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/709
DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:09Z-
dc.date.available2022-08-15T15:00:09Z-
dc.date.issued2021-
dc.identifier.issn16787544en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/709-
dc.description.abstractWe give an upper bound on the largest eigenvalue of the signless Laplacian matrix of a Hamiltonian graph. This bound is applied to obtain sufficient spectral conditions for the non-existence of Hamiltonian cycles. Under certain additional assumptions we provide a polynomial time decisive spectral criterion for the Hamiltonicity of a given graph with sufficiently large minimum vertex degree.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofBulletin of the Brazilian Mathematical Societyen_US
dc.subjectHamiltonian graphen_US
dc.subjectLargest eigenvalueen_US
dc.subjectSignless Laplacian matrixen_US
dc.subjectSpectral inequalitiesen_US
dc.titleBounds on Signless Laplacian Eigenvalues of Hamiltonian Graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s00574-020-00211-y-
dc.identifier.scopus2-s2.0-85086571340-
dc.identifier.isi000540920700001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85086571340-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn1678-7544en_US
dc.description.rankM22en_US
dc.relation.firstpage467en_US
dc.relation.lastpage476en_US
dc.relation.volume52en_US
dc.relation.issue3en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

3
checked on Feb 21, 2025

Page view(s)

18
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.