The generalized characteristic polynomial of the subdivision-vertex and subdivision-edge coronae.

From MaRDI portal
Publication:2978313

zbMATH Open1413.05240arXiv1302.0457MaRDI QIDQ2978313FDOQ2978313


Authors: Pengli Lu, Yufang Miao Edit this on Wikidata


Publication date: 21 April 2017

Abstract: The subdivision graph mathcalS(G) of a graph G is the graph obtained by inserting a new vertex into every edge of G. Let G1 and G2 be two vertex disjoint graphs. The emph{subdivision-vertex corona} of G1 and G2, denoted by G1odotG2, is the graph obtained from mathcalS(G1) and |V(G1)| copies of G2, all vertex-disjoint, by joining the ith vertex of V(G1) to every vertex in the ith copy of G2. The emph{subdivision-edge corona} of G1 and G2, denoted by G1circleddashG2, is the graph obtained from mathcalS(G1) and |I(G1)| copies of G2, all vertex-disjoint, by joining the ith vertex of I(G1) to every vertex in the ith copy of G2, where I(G1) is the set of inserted vertices of mathcalS(G1). In this paper we determine the adjacency spectra, the Laplacian spectra and the signless Laplacian spectra of G1odotG2 (respectively, G1circleddashG2) in terms of the corresponding spectra of G1 and G2. As applications, the results on the spectra of G1odotG2 (respectively, G1circleddashG2) enable us to construct infinitely many pairs of cospectral graphs. The adjacency spectra of G1odotG2 (respectively, G1circleddashG2) 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 G1odotG2 and G1circleddashG2, respectively.


Full work available at URL: https://arxiv.org/abs/1302.0457




Recommendations





Cited In (16)





This page was built for publication: The generalized characteristic polynomial of the subdivision-vertex and subdivision-edge coronae.

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