Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1017
DC FieldValueLanguage
dc.contributor.authorBožin, Vladimiren_US
dc.contributor.authorMateljević, Miodragen_US
dc.date.accessioned2022-08-17T11:43:00Z-
dc.date.available2022-08-17T11:43:00Z-
dc.date.issued2011-01-01-
dc.identifier.issn19316828en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1017-
dc.description.abstractIn this paper, we characterize graphs of maximal energy by means of orthogonal matrices. The result makes it possible to estimate energy of graphs without direct computation of eigenvalues. As an illustration, we compute the maximum energy among all graphs with n = 4k vertices, which corresponds to strongly regular graphs found by Koolen and Moulton, and apply our result to conference graphs, computing the asymptotic formula for maximal graph energy.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofSpringer Optimization and Its Applicationsen_US
dc.titleEnergy of graphs and orthogonal matricesen_US
dc.typeBook Parten_US
dc.relation.publicationApproximation and Computationen_US
dc.identifier.doi10.1007/978-1-4419-6594-3_6-
dc.identifier.scopus2-s2.0-84976342629-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84976342629-
dc.contributor.affiliationReal and Complex Analysisen_US
dc.relation.isbn978-1-4419-6593-6en_US
dc.description.rankM10en_US
dc.relation.firstpage87en_US
dc.relation.lastpage96en_US
dc.relation.volume42en_US
item.openairetypeBook Part-
item.languageiso639-1en-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
crisitem.author.deptReal and Complex Analysis-
crisitem.author.orcid0009-0001-3845-453X-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

1
checked on Dec 7, 2025

Page view(s)

9
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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