The subdivision graph of a graph is the graph obtained by inserting a new vertex into every edge of . Let and be two vertex disjoint graphs. The \emph{subdivision-vertex corona} of and , denoted by , is the graph obtained from and copies of , all vertex-disjoint, by joining the th vertex of to every vertex in the th copy of . The \emph{subdivision-edge corona} of and , denoted by $G_1\circleddash G_2(G_1)|I(G_1)|G_2iI(G_1)$ to every vertex in the th copy of , where is the set of inserted vertices of . In this paper we determine the adjacency spectra, the Laplacian spectra and the signless Laplacian spectra of $G_1\odot G_2G_1\circleddash G_2$) in terms of the corresponding spectra of and . As applications, the results on the spectra of (respectively, ) enable us to construct infinitely many pairs of cospectral graphs. The adjacency spectra of $G_1\odot G_2G_1\circleddash G_2$) help us to construct many infinite families of integral graphs. By using the Laplacian spectra, we also obtain the number of spanning trees and Kirchhoff index of and , respectively.

生成讲解博客的中文版本

生成AI智能校验的中文版本