Bulletin: Classe des sciences mathematiques et natturalles 2002 Volume 123, Issue 27, Pages: 19-31
Full text ( 137 KB)
Cited by

Tetracyclic harmonic graphs

Borovićanin Bojana D., Gutman Ivan, Petrović M.

A graph G on n vertices v1, v2,..., vn is said to be harmonic if (d(v1),d(v2),..., d(vn))t is an eigenvector of its (0,1)-adjacency matrix where d(vi) is the degree ‚(= number of first neighbors) of the vertex Vi i = 1,2,..., n. Earlier all acyclic, unicyclic, bicyclic and tricyclic harmonic graphs were characterized. We now show that there are 2 regular and 18 non-regular connected tetracyclic harmonic graphs and determine their structures.

Keywords: harmonic graphs, spectra (of graphs), walks