Spectra of $(H_1,H_2)$-merged subdivision graph of a graph
arXiv:1902.02044
The paper introduces a ternary graph operation that unifies several known constructions (subdivision, R‑graph, central, total, etc.) into a new graph denoted [S(G)]^{H1}_{H2}, and derives its adjacency and Laplacian spectra for various graph classes, using these results to compute spanning tree counts and Kirchhoff indices.
Abstract
In this paper, we define a ternary graph operation which generalizes the construction of subdivision graph, $R-$graph, central graph. Also, it generalizes the construction of overlay graph (Marius Somodi \emph{et al.}, 2017), and consequently, $Q-$graph, total graph, and quasitotal graph. We denote this new graph by $[S(G)]^{H_1}_{H_2}$, where $G$ is a graph and, $H_1$ and $H_2$ are suitable graphs corresponding to $G$. Further, we define several new unary graph operations which becomes particular cases of this construction. We determine the Adjacency and Laplacian spectra of $[S(G)]^{H_1}_{H_2}$ for some classes of graphs $G$, $H_1$ and $H_2$. From these results, we derive the $L$-spectrum of the graphs obtained by the unary graph operations mentioned above. As applications, these results enable us to compute the number of spanning trees and Kirchhoff index of these graphs.
19 pages, 2 figures