Energy of Graphs and Orthogonal Matrices

V. Božin () and M. Mateljević ()
Additional contact information
V. Božin: University of Belgrade
M. Mateljević: University of Belgrade

A chapter in Approximation and Computation, 2010, pp 87-96 from Springer

Abstract: 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 = 4 k 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.

Keywords: Orthogonal Projector; Adjacency Matrix; Maximal Energy; Regular Graph; Orthogonal Matrix (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-6594-3_6

Ordering information: This item can be ordered from
http://www.springer.com/9781441965943

DOI: 10.1007/978-1-4419-6594-3_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().