吉林大学学报（理学版）2026，Vol.64Issue(1)：69-76,8.DOI:10.13413/j.cnki.jdxblxb.2025122
树图的补距离谱半径
Spectral Radius of Complementary Distance of Tree Graphs
摘要
Abstract
By using edge-moving operations and the Perron-Frobenius theorem,we discussed the problem of the spectral radius of the complement distance of tree graph.We determined the unique trees with maximum and minimum spectral radii of the complementary distance,respectively,and determined the graph with the minimum spectral radius of the complementary distance in the complementary graph of the tree,as well as the graph with the i-th largest spectral radius of complementary distance,where i=1,2,…,(「)(n-2)/2」.关键词
补距离谱半径/补距离矩阵/距离矩阵/极值图Key words
spectral radius of complementary distance/complementary distance matrix/distance matrix/extremal graph分类
数理科学引用本文复制引用
张艳慧,马小玲..树图的补距离谱半径[J].吉林大学学报（理学版）,2026,64(1):69-76,8.基金项目
新疆维吾尔自治区自然科学基金(批准号:2021D01C069)和国家自然科学基金地区项目(批准号:12161085). （批准号:2021D01C069）
