给定点连通度的图的补图的谱半径  

The Spectral Radius of the Complements of Graphs with a Given Vertex Connectivity

作　　者：杨小波 邱欢 王国平[1] Yang Xiaobo;Qiu Huan;Wang Guoping(School of Mathematical Science,Xinjiang Normal University,Urumchi,Xinjiang 830054,China)

机构地区：[1]新疆师范大学数学科学学院,新疆乌鲁木齐830054

出　　处：《伊犁师范大学学报（自然科学版）》2024年第2期31-34,共4页Journal of Yili Normal University：Natural Science Edition

基　　金：新疆自然科学基金资助项目(2023D01A38).

摘　　要：在给定点连通度的直径不小于3的连通图的所有补图中,确定了谱半径达到最小时的极图,并证明它是唯一的.In this paper,we determine the unique graph whose spectral radius is minimum among all complements of graphs with a given vertex connectivity and diameter greater than three.

关 键 词：邻接矩阵 谱半径 补图 点连通度 

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