Tetracyclic harmonic graphs

DOI10.2298/BMAT0227019BMaRDI QIDQ2913987zbMATH OpenOpenAlexFDO

Authors B. Borovićanin, Ivan Gutman, Miroslav Petrović

Publication date 21 September 2012

Published in Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/bmat0227019b

zbMATH Keywords

adjacency matrixgraph spectrumharmonic graphwalks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Review text

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).

Recommendations

• Harmonic cycles for graphs
• scientific article; zbMATH DE number 7090166
• Harmonic graphs with small number of cycles
• Isomorphic tetravalent cyclic Haar graphs
• Quasiconformal harmonic graphs
• Semiharmonic bicyclic graphs
• On Smarandachely harmonic graphs
• scientific article; zbMATH DE number 6160538
• Harmonic labeling of graphs
• Some new classes of harmonious graphs

Cited in

(4)

• Semiharmonic trees and monocyclic graphs
• Semiharmonic graphs with fixed cyclomatic number.
• Harmonic graphs with small number of cycles
• Semiharmonic bicyclic graphs

This page was built for publication: Tetracyclic harmonic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913987)