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
Publication date: 21 April 2017
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.
Full work available at URL: https://arxiv.org/abs/1302.0457
Recommendations
- Laplacian and signless Laplacian characteristic polynomial of generalized subdivision corona vertex graph.
- The normalized Laplacian spectrum of subdivision vertex-edge corona for graphs
- Adjacency characteristic polynomial of generalized subdivision corona vertex graph
- Adjacency and Laplacian spectrum of a class of generalized corona.
- Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
spanning treescospectral graphsspectrumKirchhoff indexintegral graphssubdivision-edge coronasubdivision-vertex corona
Cited In (16)
- The \(\{1\}\)-inverse of the Laplacian of subdivision-vertex and subdivision-edge coronae with applications
- Generalized characteristic polynomial of generalized \(R\)-vertex corona.
- On the \(r\)-dynamic coloring of subdivision-edge coronas of a path
- Characteristic polynomials of subdivision graphs
- Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach
- Spectra of partially subdivision neighbourhood coronae
- Laplacian and signless Laplacian characteristic polynomial of generalized subdivision corona vertex graph.
- Spectra of the edge-subdivision-vertex and edge-subdivision-edge coronae
- First reformulated Zagreb indices of some classes of graphs
- Generalized characteristic polynomials of join graphs and their applications
- Adjacency characteristic polynomial of generalized subdivision corona vertex graph
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph
- Adjacency and Laplacian spectrum of a class of generalized corona.
- Spectra of subdivision vertex-edge corona for graphs
- On the characteristic polynomial of the subdivision-vertex join of graphs
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)