On graphs with a few distinct reciprocal distance Laplacian eigenvalues
For a $ \nu $-vertex connected graph $ \Gamma $, we consider the reciprocal distance Laplacian matrix defined as $ RD^L(\Gamma) = RT(\Gamma)-RD(\Gamma) $, i.e., $ RD^L(\Gamma) $ is the difference between the diagonal matrix of the reciprocal distance degrees $ RT(\Gamma) $ and the Harary matrix $ RD...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-10-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20231485?viewType=HTML |