Spectra of the subdivision-vertex and subdivision-edge coronae
arXiv:1302.0457
Abstract
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 , 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 , 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 (respectively, ) 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 (respectively, ) 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.
arXiv comment15 pages, 3 figure. arXiv admin note: text overlap with arXiv:1212.0851, arXiv:1212.0619; and with 1209.5906 by other authors
References in corpus (1)
Cited by in corpus (4)
- Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
- The Laplacian polynomial of graphs derived from regular graphs and applications
- Spectra of generalized corona of graphs constrained by vertex subsets
- Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach