Abstract
In this paper we study three families of graphs, one is the graphs of order n with connectivity κ(G)≤k and minimum degree δ(G)≥k. We show that among the graphs in this family, the maximum spectral radius is obtained uniquely at Kk+(Kδ−k+1∪Kn−δ−1). Another family of the graphs we study is the family of bipartite graphs with order n and connectivity k. We show that among the graphs in this family the maximum spectral radius is obtained at a graph modified from K⌊n/2⌋,n−1−⌊n/2⌋. The third family of graphs we have studied is the family of graphs with order n, connectivity k and independence number r. We determine the graphs in this family that have the maximum spectral radius.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call