Generalized characteristic polynomials of join graphs and their applications (Q2398746)

Summary: The Kirchhoff index of \(G\) is the sum of resistance distances between all pairs of vertices of \(G\) in electrical networks. \(\mathrm{LEL}(G)\) is the Laplacian-Energy-Like Invariant of \(G\) in chemistry. In this paper, we define two classes of join graphs: the subdivision-vertex-vertex join \(G_1 \circledcirc G_2\) and the subdivision-edge-edge join \(G_1 \circleddash G_2\). We determine the generalized characteristic polynomial of them. We deduce the adjacency (Laplacian and signless Laplacian, resp.) characteristic polynomials of \(G_1 \circledcirc G_2\) and \(G_1 \circleddash G_2\) when \(G_1\) is \(r_1\)-regular graph and \(G_2\) is \(r_2\)-regular graph. As applications, the Laplacian spectra enable us to get the formulas of the number of spanning trees, Kirchhoff index, and \(\mathrm{LEL}\) of \(G_1 \circledcirc G_2\) and \(G_1 \circleddash G_2\) in terms of the Laplacian spectra of \(G_1\) and \(G_2\).