Maximum spectral radius of graphs with given connectivity and minimum degree

Details Maximum spectral radius of graphs with given connectivity and minimum degree Maximum spectral radius of graphs with given connectivity and minimum degree

2011-07-27

arxiv.org/abs/1107.5359v1

Mathematics

Combinatorics

Scientific paper

Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\kappa(G) \leq k$ and showed that among those graphs, the maximum spectral radius is obtained uniquely at $K_k^n$, which is the graph obtained by joining $k$ edges from $k$ vertices of $K_{n-1}$ to an isolated vertex. In this paper, we study the spectral radius of graphs of order $n$ with $\kappa(G)\leq k$ and minimum degree $\delta(G)\geq k $. We show that among those graphs, the maximum spectral radius is obtained uniquely at $K_{k}+(K_{\delta-k+1}\cup K_{n-\delta-1})$.

Affiliated with

Also associated with

No associations

Rating

Maximum spectral radius of graphs with given connectivity and minimum degree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum spectral radius of graphs with given connectivity and minimum degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum spectral radius of graphs with given connectivity and minimum degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112493