Harmonic graphs with small number of cycles (Q1874351): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Stefan Grünewald / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Miroslav M. Petrović / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00620-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2110335662 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Harmonic graphs with small number of cycles |
scientific article |
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
