Graphs (networks) with golden spectral ratio

DOI10.1016/J.CHAOS.2007.01.007MaRDI QIDQ2477243zbMATH OpenOpenAlexFDO

Authors Ernesto Estrada

Publication date 13 March 2008

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math-ph/0612044

zbMATH Keywords

optimal networks Ramanujan graphs synchronizability

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90)

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 length 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. 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 the golden ratio. We have shown in this work that GSG 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

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Graphs (networks) with golden spectral ratio

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477243)