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/728
DC FieldValueLanguage
dc.contributor.authorLiu, Muhuoen_US
dc.contributor.authorChen, Chaohuien_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:12Z-
dc.date.available2022-08-15T15:00:12Z-
dc.date.issued2021-
dc.identifier.issn01956698en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/728-
dc.description.abstractWe determine all connected {K1,3,K5−e}-free graphs whose second largest eigenvalue does not exceed 1. Our result includes all connected line graphs with the same spectral property, and therefore strengthens the result of Petrović and Milekić (1998).en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Combinatoricsen_US
dc.titleOn graphs whose second largest eigenvalue is at most 1en_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ejc.2021.103385-
dc.identifier.scopus2-s2.0-85109579676-
dc.identifier.isi000693968000002-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85109579676-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0195-6698en_US
dc.description.rankM22en_US
dc.relation.firstpageArticle no. 103385en_US
dc.relation.volume97en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

10
checked on Oct 24, 2025

Page view(s)

17
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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