The Spectral Radius of the Complements of Graphs with a Given Vertex Connectivity
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.
the adjacency matrixspectral radiuscomplements of graphsvertex connectivity
NETL
NSTL
万方数据
