树图的补距离谱半径OA
Spectral Radius of Complementary Distance of Tree Graphs
利用移边操作和Perron-Frobenius定理讨论树图的补距离谱半径问题,分别确定最大和最小的补距离谱半径的唯一树,并确定在树的补图中补距离谱半径最小的图,以及补距离谱半径第i大的图,其中i=1,2,…,(「)(n-2)/2」.
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」.
张艳慧;马小玲
新疆大学数学与系统科学学院,乌鲁木齐 830017新疆大学数学与系统科学学院,乌鲁木齐 830017
数理科学
补距离谱半径补距离矩阵距离矩阵极值图
spectral radius of complementary distancecomplementary distance matrixdistance matrixextremal graph
《吉林大学学报（理学版）》 2026 (1)
69-76,8
新疆维吾尔自治区自然科学基金(批准号:2021D01C069)和国家自然科学基金地区项目(批准号:12161085).
评论