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/772
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:16Z-
dc.date.available2022-08-15T15:00:16Z-
dc.date.issued2009-04-15-
dc.identifier.issn00243795en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/772-
dc.description.abstractWe determine all nested split graphs (i.e. graphs having no induced subgraphs equal to 2 K2, P4 or C4) having the second largest eigenvalue less than 1 and give some data and observations regarding obtained results. © 2008 Elsevier Inc. All rights reserved.en
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectAdjacency matrixen
dc.subjectDivisor techniqueen
dc.subjectNested split graphsen
dc.subjectSecond largest eigenvalueen
dc.titleOn nested split graphs whose second largest eigenvalue is less than 1en_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.laa.2008.11.026-
dc.identifier.scopus2-s2.0-61549132286-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/61549132286-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage2200en
dc.relation.lastpage2211en
dc.relation.volume430en
dc.relation.issue8-9en
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

24
checked on Nov 8, 2024

Page view(s)

12
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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