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
dc.relation.ispartofBulletin of the Brazilian Mathematical Societyen
dc.subjectHamiltonian graphen
dc.subjectLargest eigenvalueen
dc.subjectSignless Laplacian matrixen
dc.subjectSpectral inequalitiesen
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.urlhttps://api.elsevier.com/content/abstract/scopus_id/85086571340-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.description.rankM22en_US
dc.relation.firstpage467en
dc.relation.lastpage476en
dc.relation.volume52en
dc.relation.issue3en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

2
checked on Nov 8, 2024

Page view(s)

17
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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