On Laplacian and Distance Laplacian Spectra of Generalized Fan Graph & a New Graph Class

Abstract

Given a graph $G$, the Laplacian matrix of $G$, $L(G)$ is the difference of the adjacency matrix $A(G)$ and $\text{Deg}(G)$, where $\text{Deg}(G)$ is the diagonal matrix of vertex degrees. The distance Laplacian matrix $D^L(G)$ is the difference of the transmission matrix of $G$ and the distance matrix of $G$. In the given paper, we first obtain the Laplacian and distance Laplacian spectrum of generalized fan graphs. We then introduce a new graph class which is denoted by $\mathcal{N}\mathcal{C}(F_{m,n})$. Finally, we determine the Laplacian spectrum and the distance Laplacian spectrum of $\mathcal{N}\mathcal{C}(F_{m,n})$.

15 Pages, 4 Figures, Accepted for Publication