Graphs (networks) with golden spectral ratio

Ernesto Estrada

Chaos, Solitons & Fractals, 2007, vol. 33, issue 4, 1168-1182

Abstract: We propose two new spectral measures for graphs and networks which characterize the ratios between the width of the “bulk” part of the spectrum and the spectral gap, as well as the ratio between spectral spread and the width of the “bulk” part of the spectrum. Using these definitions we introduce the concept of golden spectral graphs (GSG), which are graphs for which both spectral ratios are identical to the golden ratio, φ=1+5/2. Then, we prove several analytic results to finding the smallest GSG as well as to build families of GSGs. We also prove some non-existence results for certain classes of graphs. We explore by computer several classes of graphs and found some almost GSGs. Two networks representing real-world systems were also found to have spectral ratios very close to φ. We have shown in this work that GSGs display good expansion properties, many of them are Ramanujan graphs and also are expected to have very good synchronizability. In closing, golden spectral graphs are optimal networks from a topological and dynamical point of view.

Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077907000318
Full text for ScienceDirect subscribers only

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:eee:chsofr:v:33:y:2007:i:4:p:1168-1182

DOI: 10.1016/j.chaos.2007.01.007

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().