On the characteristic polynomial of the AαA_α-matrix for some operations of graphs

preprint2022arXivOpen access

Abstract

Let G be a graph of order nn with adjacency matrix A(G)A(G) and diagonal matrix of degree D(G)D(G). For every α∈[0,1]α\in [0,1], Nikiforov \cite{VN17} defined the matrix Aα(G)=αD(G)+(1−α)A(G)A_α(G) = αD(G) + (1-α)A(G). In this paper we present the Aα(G)A_α(G)-characteristic polynomial when GG is obtained by coalescing two graphs, and if GG is a semi-regular bipartite graph we obtain the AαA_α-characteristic polynomial of the line graph associated to GG. Moreover, if GG is a regular graph we exhibit the AαA_α-characteristic polynomial for the graphs obtained from some operations.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.