On Laplacian and distance Laplacian spectra of generalized fan graph and a new graph class
By: Subarsha Banerjee and Soumya Ganguly
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 𝒩 𝒞 (Fm,n). Finally, we determine the Laplacian spectrum and the distance Laplacian spectrum of 𝒩 𝒞 (Fm,n).
DOI: https://doi.org/10.2478/ijmce-2025-0021 | Journal eISSN: 2956-7068
Language: English
Page range: 293 - 306
Submitted on: Jan 1, 2024
Accepted on: May 9, 2024
Published on: Dec 16, 2025
Published by: Harran University
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2025 Subarsha Banerjee, Soumya Ganguly, published by Harran University
This work is licensed under the Creative Commons Attribution 4.0 License.