摘要
设G为n阶简单连通图,Gc为G的补图,ρ(G)和ρ(Gc)分别为图G和Gc的邻接谱半径.本文给出了图与其补图谱半径之和ρ(G)+ρ(Gc)的上界,从而改进了已有的结果.
Let G be a simple connected graph with n vertices and let G^c be its complement. Let ρ （G） and ρ（ G^c ） be the adjacency spectral radius of G and G^c, respectively. In this paper, the new upper bounds on sun of spectral radius of a graph and its complement are given and the existing results are improved.
出处
《淮阴师范学院学报（自然科学版）》
CAS
2005年第4期268-271,共4页
Journal of Huaiyin Teachers College;Natural Science Edition
关键词
补图
谱半径
上界
色数
complement graph
spectral radius
upper bound
chromatic number
