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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Taylor & Francis Group
2023-09-01
|
| Colección: | AKCE International Journal of Graphs and Combinatorics |
| Materias: | |
| Acceso en línea: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2219335 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
