Abstract
Let G be a graph of order with adjacency matrix and diagonal matrix of degree . For every , Nikiforov \cite{VN17} defined the matrix . In this paper we present the -characteristic polynomial when is obtained by coalescing two graphs, and if is a semi-regular bipartite graph we obtain the -characteristic polynomial of the line graph associated to . Moreover, if is a regular graph we exhibit the -characteristic polynomial for the graphs obtained from some operations.
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.