Abstract
A universal adjacency matrix of a graph with adjacency matrix is any matrix of the form with , where is the identity matrix, is the all-ones matrix and is the diagonal matrix with the vertex degrees. In the case that is the disjoint union of regular graphs, we present an expression for the characteristic polynomials of the various universal adjacency matrices in terms of the characteristic polynomials of the adjacency matrices of the components. As a consequence we obtain a formula for the characteristic polynomial of the Seidel matrix of , and the signless Laplacian of the complement of (i.e. the join of regular graphs).
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.