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 Deg(G), where Deg(G) is the diagonal matrix of vertex degrees. The distance Laplacian matrix DL(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 NC(Fm,n). Finally, we determine the Laplacian spectrum and the distance Laplacian spectrum of NC(Fm,n).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.