Extremal values for the spectral radius of the normalized distance Laplacian
Linear Algebra and its Applications(2024)
摘要
The normalized distance Laplacian of a graph G is defined as DL(G)=T(G)−1/2(T(G)−D(G))T(G)−1/2 where D(G) is the matrix with pairwise distances between vertices and T(G) is the diagonal transmission matrix. In this project, we study the minimum and maximum spectral radii associated with this matrix, and the structures of the graphs that achieve these values. In particular, we prove a conjecture of Reinhart that the complete graph is the unique graph with minimum spectral radius, and we give several partial results towards a second conjecture of Reinhart regarding which graph has the maximum spectral radius.
更多查看译文
关键词
Normalized distance Laplacian,spectral radius,extremal spectral graph theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要