The normalized Laplacian and related indexes of graphs with edges blew up by cliques

Abstract

In this paper, we introduce the clique-blew up graph $CL(G)$ of a given graph $G$, which is obtained from $G$ by replacing each edge of $G$ with a complete graph $K_n$. We characterize all the normalized Laplacian spectrum of the grpah $CL(G)$ in term of the given graph $G$. Based on the spectrum obtained, the formulae to calculate the multiplicative degree-Kirchhoff index, the Kemeny's constant and the number of spanning trees of $CL(G)$ are derived well. Finally, the spectrum and indexes of the clique-blew up iterative graphs are present.

References in corpus (5)

• The Role of Kemeny's Constant in Properties of Markov Chains
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• The normalized Laplacian spectrum of subdivisions of a graph
• Minimum vertex covers and the spectrum of the normalized Laplacian on trees
• On the normalized spectrum of threshold graphs