Semiharmonic trees and monocyclic graphs Original Research Article

A graph G is defined to be semiharmonic if there is a constant μ (necessarily a natural number) such that, for every vertex v, the number of walks of length 3 starting in v equals μdG(v) where dG(v) is the degree of v. We determine all finite semiharmonic trees and monocyclic graphs.