On the distance Laplacian spectral radius of bicyclic graphs
Linear & Multilinear Algebra（2021）
摘要
The distance Laplacian matrix of a connected graph G is defined as L(G)=Tr(G)−D(G), where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G. The lar...
更多查看译文
关键词
Distance Laplacian matrix,eigenvalues,spectral radius,bicyclic graph
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要