Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1017
Title: Energy of graphs and orthogonal matrices
Authors: Božin, Vladimir 
Mateljević, Miodrag
Affiliations: Real and Complex Analysis 
Issue Date: 1-Jan-2011
Rank: M10
Publisher: Springer
Related Publication(s): Approximation and Computation
Journal: Springer Optimization and Its Applications
Abstract: 
In 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.
URI: https://research.matf.bg.ac.rs/handle/123456789/1017
ISSN: 19316828
DOI: 10.1007/978-1-4419-6594-3_6
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

1
checked on Nov 3, 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.