DC FieldValueLanguage
dc.contributor.authorAndelić, 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.issued2012-03-01en
dc.identifier.issn0166-218Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1132-
dc.description.abstractThe Q-index of a simple graph G is the largest eigenvalue of the matrix Q, the signless Laplacian of G. It is well-known that in the set of connected graphs with fixed order and size, the graphs with maximal Q-index are the nested split graphs (also known as threshold graphs). In this paper, we focus our attention on the eigenvector techniques for getting some (lower and upper) bounds on the Q-index of nested split graphs. In addition, we give some computational results in order to compare these bounds.en
dc.publisherElsevier-
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.ispartofDiscrete Applied Mathematicsen
dc.subjectLargest eigenvalue | Nested split graph | Signless Laplacian | Spectral bounds | Spectral radius | Threshold graphen
dc.titleConnected graphs of fixed order and size with maximal Q-index: Some spectral boundsen
dc.typeArticleen
dc.identifier.doi10.1016/j.dam.2011.11.001en
dc.identifier.scopus2-s2.0-84856110029en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage448en
dc.relation.lastpage459en
dc.relation.issue4-5en
dc.relation.volume160en
dc.description.rankM22-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
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

14
checked on Apr 18, 2025

Page view(s)

19
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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