带有割点的图的补图的距离谱半径  

Distance spectral radius of complements of graphs with cut vertices

作　　者：陈旭[1] 邵荣侠 王国平[2] CHEN Xu;SHAO Rongxia;WANG Guoping(School of Statistics and Data Science,Xinjiang University of Finance and Economics,Urumqi 830012,Xinjiang,China;School of Mathematical Sciences,Xinjiang Normal University,Urumqi 830017,Xinjiang,China)

机构地区：[1]新疆财经大学统计与数据科学学院,新疆乌鲁木齐830012 [2]新疆师范大学数学科学学院,新疆乌鲁木齐830017

出　　处：《山东大学学报(理学版)》2025年第2期19-23,共5页Journal of Shandong University(Natural Science)

基　　金：2023年校级教学改革项目(4008107)

摘　　要：本文确定了所有团树的补图中距离谱半径分别是最大和最小的图,给出了所有带有割点的图的补图中距离谱半径分别是最大和最小的图。This paper determines the graphs with maximum and minimum distance spectral radi in the complement graphs of all clique trees,and provides the graphs with maximum and minimum distance spectral radii in the complement graphs of all graphs withcutvertices.

关 键 词：距离谱半径 补图 团树 割点 

分 类 号：O157.5[理学—数学]