Construction of non-regular A_\alpha-cospectral graphs from some join of graphs

arXiv2210.06715MaRDI QIDQ6506780FDOQ6506780

Authors: Najiya V K, Chithra A 

Abstract: Let $G$ be a graph on $n$ vertices with adjacency matrix $A(G)$ and degree matrix $D(G)$. For every $alphain[0,1]$, $A_{a}lpha(G)$ is defined as $A_{a}lpha(G)=alphaD(G)+(1-alpha)A(G)$. In this paper, we present the $A_{a}lpha$-characteristic polynomial and $A_{a}lpha$-spectrum of central graph of a regular graph. Moreover, the $A_{a}lpha$- characteristic polynomial of central vertex join of a regular graph and an arbitrary graph is calculated and the $A_{a}lpha$-spectrum of central vertex join of two regular graphs is estimated. As an application, we obtain infinitely many $A_{a}lpha$-cospectral graphs.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: Construction of non-regular $A_\alpha$-cospectral graphs from some join of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506780)