The generalized adjacency spectra of triple vertex and triple edge join of graphs

Document Type : Research Paper

Authors

Department of Applied Sciences, Tezpur University, Napaam-784028, Assam, India.

10.22034/as.2026.23908.1849

Abstract

Consider three graphs $G_1$, $G_2$, and $H$ with orders $n_1,~n_2, n_3,$ and sizes $m_1,m_2,m_3,$ respectively, where the sets of vertices for all three graphs are disjoint. Let $S(G_1, H)$ be the graph obtained from $G_1$ and $H$ in the following way: 
(1) Delete all the edges of $G_1$ and consider $m_1$ disjoint copies of $H$. 
(2) Join each vertex of the $i^{th}$ copy of $H$ to the end vertices of the $i^{th}$ edge of $G_1$.
Using this construction, the graph $G_1(\vee_H)G_2$ is defined to be the graph obtained from $S(G_1, H)$ by joining every vertex of $G_1$ to every vertex of $G_2$ (see \cite{som1}). In a similar manner, we define $G_1(\Lambda_H)G_2$ to be the graph formed by connecting every vertex in each of the $m_1$ inserted copies of $H$ in $S(G_1, H)$ to all vertices of $G_2$. We refer to $G_1(\vee_H)G_2$ and $G_1(\Lambda_H)G_2$ as the \emph{triple vertex join} and \emph{triple edge join} of $G_1$ and $G_2$ with respect to $H$, respectively.
In this article, we determine the generalized adjacency spectra (also known as the $A_\alpha$-spectra) of $G_1(\vee_H)G_2$ when $G_1$ is regular, and of $G_1(\Lambda_H)G_2$ when both $G_1$ and $H$ are regular. Furthermore, we present an application demonstrating the construction of infinitely many $A_\alpha$-cospectral graphs.

Keywords

Main Subjects


[1] R. B. Bapat, Graphs and Matrices, Springer, London, 2014.
[2] S. Barik, S. Pati and B. K. Sarma, The spectrum of the corona of two graphs, SIAM J. Discrete Math., 21 (2007) 47-56.
[3] M. Basunia, I. Mahato and M. R. Kannan, On the Aα-spectra of some join graphs, Bull. Malays. Math. Sci. Soc., 44 (2021) 4269-4297.
[4] D. Bonchev and D. H. Rouvray (Eds.), Chemical Graph Theory: Introduction and Fundamentals, Vol. 1, Abacus Press, New York, 1991.
[5] A. E. Brouwer and W. H. Haemers, Spectra of Graphs, Springer, New York, 2012.
[6] S. Y. Cui and G. X. Tian, The spectrum and the signless Laplacian spectrum of coronae, Linear Algebra Appl., 437 (2012) 1692-1703.
[7] D. Cvetković, P. Rowlinson, S. Simić, An Introduction to the Theory of Graph Spectra, Cambridge University Press, Cambridge, 2010.
[8] A. Das and P. Panigrahi, Spectra of R-vertex join and R-edge join of two graphs, Discuss. Math. Gen. Algebra Appl., 38 (2018) 19-31.
[9] Y. Hou and W. C. Shiu, The spectrum of the edge corona of two graphs, Electron. J. Linear Algebra, 20 (2010) 586-594.
[10] G. Indulal, Spectrum of two new joins of graphs and infinite families of integral graphs, Kragujevac J. Math., 36 (2012) 133-139.
[11] J. Lan and B. Zhou, Spectra of graph operations based on R-graph, Linear Multilinear A., 63 (2015) 1401-1422.
[12] S. Li and S. Wang, The Aα-spectrum of graph product, Electron. J. Linear Algebra, 35 (2019) 473-481.
[13] H. Lin and X. Liu, J. Xue, Graphs determined by their Aα-spectra, Discrete Math., 342 (2019) 441-450.
[14] X. Liu and S. Liu, On the Aα-characteristic polynomial of a graph, Linear Algebra Appl., 546 (2018) 274-288.
[15] X. Liu and Z. Zhang, Spectra of subdivision-vertex join and subdivision-edge join of two graphs, Bull. Malays. Math. Sci. Soc., 42 (2019) 15-31.
[16] X. Liu and S. Zhou, Spectra of the neighbourhood corona of two graphs, Linear Multilinear A., 62 (2014) 1205-1219.
[17] C. McLeman and E. McNicholas, Spectra of coronae, Linear Algebra Appl., 435 (2011) 998-1007.
[18] V. Nikiforov, Merging the A- and Q-spectral theories, Appl. Anal. Discrete Math., 11 (2017) 81-107.
[19] S. Paul, The spectra of a new join of graphs, Discrete Math. Algorithms Appl., 10 (2018) 1850074.
[20] M. A. Tahir and X. -D. Zhang, Coronae graphs and their α-eigenvalues, Bull. Malays. Math. Sci. Soc., 43 (2020) 2911-2927.
[21] E. R. Van Dam and W. H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl., 373 (2003) 241-272.
[22] S. Wang and B. Zhou, The signless Laplacian spectra of the corona and edge corona of two graphs, Linear Multilinear A., 61 (2013) 197-204.
[23] F. Zhang (Ed.), The Schur Complement and Its Applications, Springer, New York, 2005.
[24] L. Zhang and J. B. Liu, Theoretical and computational methods to resistance distances in novel graph operations, IEEE Access, 7 (2019) 107908-107916.