DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:48Z-
dc.date.available2020-05-01T20:12:48Z-
dc.date.issued2010-09-28en
dc.identifier.issn0012-365Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1146-
dc.description.abstractIn this paper we consider threshold graphs (also called nested split graphs) and investigate some invariants of these graphs which can be of interest in bounding the largest eigenvalue of some graph spectra.en
dc.publisherElsevier-
dc.relationFCT-Fundação para a Ciência e a Tecnologia, Grant SFRH/BD/ 44606/2008-
dc.relationSerbian Ministry for Science, Grant 144015G-
dc.relation.ispartofDiscrete Mathematicsen
dc.subjectAdjacency matrix | Largest eigenvalue | Line graph | Nested split graph | Signless Laplacian | Threshold graphen
dc.titleSome notes on the threshold graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.disc.2010.04.022en
dc.identifier.scopus2-s2.0-77954177321en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage2241en
dc.relation.lastpage2248en
dc.relation.issue17-18en
dc.relation.volume310en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeArticle-
Show simple item record

SCOPUSTM   
Citations

22
checked on May 26, 2026

Page view(s)

107
checked on May 25, 2026

Google ScholarTM

Check

Altmetric

Altmetric


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