DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen
dc.contributor.authorAndrade, Enideen
dc.contributor.authorCardoso, Domingosen
dc.contributor.authorDa Fonseca, Carlosen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorTošić, Dejanen
dc.date.accessioned2020-05-01T20:12:46Z-
dc.date.available2020-05-01T20:12:46Z-
dc.date.issued2015-07-02en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1123-
dc.description.abstractIn the set of all connected graphs with fixed order and size, the graphs with maximal index are nested split graphs, also called threshold graphs. It was recently (and independently) observed in Bell et al. (2008) [3] and Bhattacharya et al. (2008) [4] that double nested graphs, also called bipartite chain graphs, play the same role within class of bipartite graphs. In this paper we study some structural and spectral features of double nested graphs. In studying the spectrum of double nested graphs we rather consider some weighted nonnegative matrices (of significantly less order) which preserve all positive eigenvalues of former ones. Moreover, their inverse matrices appear to be tridiagonal. Using this fact we provide several new bounds on the index (largest eigenvalue) of double nested graphs, and also deduce some bounds on eigenvector components for the index. We conclude the paper by examining the questions related to main versus non-main eigenvalues.en
dc.publisherElsevier-
dc.relationQREN project Cloud Thinking (CENTRO-07-ST24-FEDER-002031)-
dc.relationFCT - Fundação para a Ciência e a Tecnologia, Project PEst-UID/MAT/04106/2013-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationDevelopment of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectBipartite graph | Double nested graph | Largest eigenvalue | Main eigenvalue | Spectral boundsen
dc.titleSome new considerations about double nested graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2015.06.010en
dc.identifier.scopus2-s2.0-84933576183en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage323en
dc.relation.lastpage341en
dc.relation.volume483en
dc.description.rankM21-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/044006e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.fundingProgramNATIONAL HEART, LUNG, AND BLOOD INSTITUTE-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NIH/NATIONAL HEART, LUNG, AND BLOOD INSTITUTE/5R01HL044006-04-
Show simple item record

SCOPUSTM   
Citations

19
checked on Jul 14, 2024

Page view(s)

42
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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