Let G is a connected graph with n vertices and m=(m1,m2,…,mp)is a positive integer vector.The spectral radius ρ(G)is the maximum value of the eigenvalue of the graph G,denoted as ρ(G)=max|λi|.The spectral radius and rank of the graph were defined as the spectral radius and rank of its adjacency matrix,respectively.In the theory of spectral extremums,it was an important problem to determine the maximum or minimum spectral radius.This paper found out the plots of the maximum and minimum spectral radius in the bipartite connected graph with rank 6.
万方数据
维普
