DC FieldValueLanguage
dc.contributor.authorStevanović, Draganen
dc.contributor.authorGutman, Ivanen
dc.contributor.authorRehman, Masooden
dc.date.accessioned2020-05-01T20:12:59Z-
dc.date.available2020-05-01T20:12:59Z-
dc.date.issued2015-01-01en
dc.identifier.issn1855-3966en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1239-
dc.description.abstractLet Kn1;n2...;np denote the complete p-partite graph, p > 1, on n = n1+n2+...+np vertices and let n1≥ n2 ≥ ...≥ np > 0. We show that for a fixed value of n, both the spectral radius and the energy of complete p-partite graphs are minimal for complete split graph CS(n; p - 1) and are maximal for Tuŕan graph T(n; p).en
dc.publisherDMFA Slovenije-
dc.relationSlovenian Research Agency, Projects P1-0285 and J1-4021-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofArs Mathematica Contemporaneaen
dc.subjectComplete multipartite graph | Complete split graph | Graph energy | Spectral radius of graph | Tuŕan graphen
dc.titleOn spectral radius and energy of complete multipartite graphsen
dc.typeArticleen
dc.identifier.doi10.26493/1855-3974.499.103-
dc.identifier.scopus2-s2.0-85007574628en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage109en
dc.relation.lastpage113en
dc.relation.issue1en
dc.relation.volume9en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2908-305X-
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

29
checked on Apr 2, 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.