Spectra of new graph operations based on central graph

2021/07/02 by T K Jahfar, Jahfar, T K, A. V. Chithra +1
Mathematics · Computer Science · Chemistry · #Graph theory and applications #Computational Drug Discovery Methods #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.2107.00854

Abstract

In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum. From our results, it is possible to obtain infinitely many pairs of adjacency (respectively, Laplacian and signless Laplacian) cospectral graphs. As an application, we calculate the number of spanning trees and the Kirchhoff index of the resulting graphs.

Related

• The normalized Laplacian spectra of subdivision vertex-edge neighbourhood vertex(edge)-corona for graphs
• On the spectrum of closed neighborhood corona product of graph and its application
• Spectra of the subdivision-vertex and subdivision-edge coronae
• Cospectral constructions for several graph matrices using cousin vertices
• Spectra of (H₁,H₂)-merged subdivision graph of a graph