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/3204
DC FieldValueLanguage
dc.contributor.authorChen, Chaochuien_US
dc.contributor.authorShan, Haiyingen_US
dc.contributor.authorLiu, Muhuoen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2026-03-16T15:35:58Z-
dc.date.available2026-03-16T15:35:58Z-
dc.date.issued2026-08-01-
dc.identifier.issn0012365X-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/3204-
dc.description.abstractBy extending the main result of [European J. Combin., 97 (2021), 103385], we determine all connected claw-free graphs whose second largest eigenvalue does not exceed 1, where a claw is the star K<inf>1,3</inf>. In contrast to the existing results on graphs with the same spectral property, our approach introduces a technique that systematically analyses complementary graphs of graphs under consideration.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Mathematicsen_US
dc.subjectComplementary graphen_US
dc.subjectForbidden induced subgraphen_US
dc.subjectGraph spectrumen_US
dc.subjectSecond largest eigenvalueen_US
dc.titleConnected claw-free graphs whose second largest eigenvalue does not exceed 1en_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.disc.2026.115079-
dc.identifier.scopus2-s2.0-105032210443-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/105032210443-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0012-365Xen_US
dc.description.rankM21en_US
dc.relation.firstpageArticle no. 115079en_US
dc.relation.volume349en_US
dc.relation.issue8en_US
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


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