Maximum spectral radius of graphs with given connectivity, minimum degree and independence number

Title: Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
Creator: Lu, Hongliang; Lin, Yuqing
Relation: Journal of Discrete Algorithms Vol. 31, Issue March 2015, p. 113-119
Publisher Link: http://dx.doi.org/10.1016/j.jda.2014.08.006
Publisher: Elsevier
Resource Type: journal article
Date: 2015
Description: 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 K_k+(K_δ−k+1∪K_n−δ−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.
Subject: connectivity; maximum special radius; independence number
Identifier: http://hdl.handle.net/1959.13/1315612
Identifier: uon:22971
Identifier: ISSN:1570-8667
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format