On graphs with distance Laplacian eigenvalues of multiplicity n−4

On graphs with distance Laplacian eigenvalues of multiplicity n−4

AbstractLet G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance matrix of G. The eigenvalues of [Formula: s...

Full description

Bibliographic Details
Main Authors: Saleem Khan, S. Pirzada, A. Somasundaram
Format: Article
Language:English
Published: Taylor & Francis Group 2023-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Distance matrix
distance Laplacian matrix
spectral radius
multiplicity of distance Laplacian eigenvalue
05C50
05C12
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2023.2219335

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2023.2219335

Similar Items