On the multiplicities of distance Laplacian eigenvalues

Comput. Appl. Math.(2023)

引用 0|浏览2
暂无评分
摘要
In this work, connected graphs of order n and largest eigenvalue of the distance Laplacian matrix with multiplicity equal to n-4 are investigated. A complete characterization is presented if n is one of its distance Laplacian eigenvalues with multiplicity one. We also present a conjecture about forbidden subgraphs of G when the multiplicity of its largest eigenvalue is n-4, and we analyze the case where G has diameter four.
更多
查看译文
关键词
Distance Laplacian matrix, Laplacian matrix, Multiplicity of eigenvalues
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要