Spectra of four new Graphs join based on Subdivision and Central Graph

Authors

Keywords:

Adjacency spectrum, Laplacian spectrum, Cospectral graphs, Kirchhoff index, spanning trees

Abstract

We define four new graphs through the join operation of subdivision graph S(G) and central graph C(H), namely subdivision vertex-central vertex join S(G)C(H), subdivision edge-central edge join S(G)C(H), subdivision edge-central vertex join S(G)C(H), and subdivision vertex-central edge join S(G)C(H) graphs. We determine the adjacency and Laplacian spectra of these four graphs and generate a set of A-cospectral and L-cospectral non-regular graphs for these new graphs by choosing two pairs of regular cospectral graphs. Additionally, we compute the Kirchhoff indices and the number of spanning trees in these graphs.

Downloads

Published

2024-09-15

How to Cite

Manash Protim Borah, Karam Ratan Singh, & S. Prasad. (2024). Spectra of four new Graphs join based on Subdivision and Central Graph. Journal of Computational Analysis and Applications (JoCAAA), 33(05), 324–333. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/506

Issue

Section

Articles

Similar Articles

1 2 3 4 5 6 7 8 > >> 

You may also start an advanced similarity search for this article.