Tetracyclic harmonic graphs (Q2913987)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tetracyclic harmonic graphs |
scientific article; zbMATH DE number 6085311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tetracyclic harmonic graphs |
scientific article; zbMATH DE number 6085311 |
Statements
Tetracyclic harmonic graphs (English)
0 references
21 September 2012
0 references
adjacency matrix
0 references
graph spectrum
0 references
harmonic graph
0 references
walks
0 references
0 references
0.8916358
0 references
0.8856146
0 references
0 references
0 references
0 references
0 references
0 references
A graph on \(n\) vertices is harmonic if \((d_1,d_2,\dots,d_n)^T\) (where \(d_i\) is the degree of its \(i\)-th vertex), is an eigenvector of its adjacency matrix. All acyclic, unicyclic, bicyclic and tricyclic harmonic graphs were identified in the literature so far. Here the authors identify all connected tetracyclic harmonic graphs (2 of them are regular, while 18 nonregular).
0 references
