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_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofLinear Algebra and Its Applicationsen_US
dc.subjectAdjacency matrixen_US
dc.subjectDivisor techniqueen_US
dc.subjectNested split graphsen_US
dc.subjectSecond largest eigenvalueen_US
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.isi000264864400027-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/61549132286-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0024-3795en_US
dc.description.rankM22en_US
dc.relation.firstpage2200en_US
dc.relation.lastpage2211en_US
dc.relation.volume430en_US
dc.relation.issue8-9en_US
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
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

25
checked on Mar 29, 2025

Page view(s)

13
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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