Graphs cospectral with starlike trees (Q952060): Difference between revisions

A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper is introduced a generalization of the notion of cospectrality called \(m\)-cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, some cospectral mates for sam starlike trees are constructed. It is also presented a set of necessary and sufficient conditions for divisibility of the characteristic polynomial of a starlike tree by the characteristic polynomial of a path.