DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen
dc.contributor.authorDa Fonseca, Carlosen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorTošić, Dejanen
dc.date.accessioned2020-05-01T20:12:47Z-
dc.date.available2020-05-01T20:12:47Z-
dc.date.issued2011-11-15en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1135-
dc.description.abstractThe index of a simple graph is the largest eigenvalue of its adjacency matrix. It is well-known that in the set of all connected graphs with fixed order and size the graphs with maximal index are nested split graphs. It was recently observed that double nested graphs assume the same role if we restrict ourselves to bipartite graphs. In this paper we provide some bounds (lower and upper) for the index of double nested graphs. Some computational results are also included.en
dc.publisherElsevier-
dc.relationFCT - Fundação para a Ciência e a Tecnologia, Grant No. SFRH/BD/44606/2008-
dc.relationSerbian Ministry of Science, Grant No. 144015G-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectBipartite graphs | Double nested graphs | Largest eigenvalue | Spectral bounds | Spectral radiusen
dc.titleOn bounds for the index of double nested graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2010.12.017en
dc.identifier.scopus2-s2.0-79958811064en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage2475en
dc.relation.lastpage2490en
dc.relation.issue10en
dc.relation.volume435en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Show simple item record

SCOPUSTM   
Citations

20
checked on Jul 12, 2024

Page view(s)

40
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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