摘要
设图G是一个简单连通图,点v_(i)和v_(j)之间最短路径的长度称为点v_(i)和v_(j)在图G中的距离,记作dG(v_(i),v_(j)).图G的距离矩阵为D(G)=(dG(v_(i),v_(j)))n×n.距离矩阵D(G)特征值的模的最大值称为图G的距离谱半径.在n阶双圈图补图中刻画了距离谱半径最大的极图.
Let G be a simple connected graph.The distance between vertices v_(i) and v_(j) in the graph G,denoted by dG(v_(i),v_(j)),is the length of the shortest path from v_(i) to v_(j),and D(G)=(dG(v_(i),v_(j)))n×n is the distance matrix of G.The distance spectral radius of G is defined as the maximum module of eigenvalues of distance matrix D(G).We characterize the extremal graph among the complements of bicyclic graphs with n-order which maximizes the distance spectral radius.
作者
李远菁
李丹
刘康
LI Yuanjing;LI Dan;LIU Kang(School of Mathematics and System Sciences,Xinjiang University,Urumqi Xinjiang 830017,China)
出处
《新疆大学学报(自然科学版)(中英文)》
CAS
2023年第2期184-190,221,共8页
Journal of Xinjiang University(Natural Science Edition in Chinese and English)
基金
国家自然科学基金“关于图的距离矩阵的相关特征值的研究”(11901498)。
关键词
双圈图
补图
距离谱半径
bicyclic graphs
complements of graphs
distance spectral radius