Harmonic graphs with small number of cycles (Q1874351): Difference between revisions

A graph is harmonic if its degree vector is also its principal eigenvector. Trivially, all regular graphs are harmonic. All harmonic trees were determined by \textit{S. Grünewald} [Appl. Math. Lett. 15, 1001-1004 (2002)]. Here the authors show that for any \(c>1\) the number of connected harmonic graphs with cyclomatic number \(c\) is finite, and they determine all harmonic graphs with cyclomatic number up to 4 (but those with cyclomatic number 4 without proof).