DC FieldValueLanguage
dc.contributor.authorPetrović, Miroslaven
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:47Z-
dc.date.available2020-05-01T20:12:47Z-
dc.date.issued2015-06-04en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1125-
dc.description.abstractIn this paper the unique graph with maximal index (i.e. the largest eigenvalue of the adjacency matrix) is identified among all connected bipartite graphs of order n and size n+k, under the assumption that k≥0 and n≥k+5.en
dc.publisherElsevier-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectAdjacency matrix | Bipartite chain graphs | Double nested graphs | Graph spectrum | Largest eigenvalueen
dc.titleA note on connected bipartite graphs of fixed order and size with maximal indexen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2015.05.013en
dc.identifier.scopus2-s2.0-84930942280en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage21en
dc.relation.lastpage29en
dc.relation.volume483en
dc.description.rankM21-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

6
checked on Apr 17, 2024

Page view(s)

43
checked on Apr 16, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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