Harmonic graphs with small number of cycles (Q1874351)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1915533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Harmonic graphs with small number of cycles |
scientific article; zbMATH DE number 1915533 |
Statements
Harmonic graphs with small number of cycles (English)
0 references
25 May 2003
0 references
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).
0 references
harmonic graphs
0 references
spectrum of graph
0 references
cyclomatic number
0 references
unicyclic graphs
0 references
bicyclic graphs
0 references
tricyclic graphs
0 references
tetracyclic graphs
0 references
regular graphs
0 references
0.8732271194458008
0 references
0.8308919668197632
0 references
0.8229365944862366
0 references
0.8184443116188049
0 references
