Abstract
We consider matrices of the form , with being the diagonal matrix of degrees, being the adjacency matrix, and a fixed value. Given a graph and , which we call a coalescent pair , we derive a formula for the characteristic polynomial where a copy of same rooted graph is attached by the root to \emph{each} vertex of . Moreover, we establish if and are two coalescent pairs which are cospectral for any possible rooted graph , then and will also always be cospectral for any possible rooted graph .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.