scholarly journals The largest eigenvalue distribution of the laguerre unitary ensemble

2017 ◽  
Vol 37 (2) ◽  
pp. 439-462 ◽  
Author(s):  
Shulin LYU ◽  
Yang CHEN
Author(s):  
Jürgen Jost ◽  
Raffaella Mulas ◽  
Florentin Münch

AbstractWe offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least $$\frac{n+1}{n-1}$$ n + 1 n - 1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $$\frac{n-1}{2}$$ n - 1 2 . With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $$\frac{n-1}{2}$$ n - 1 2 .


2021 ◽  
Vol 9 (1) ◽  
pp. 19-21
Author(s):  
Zoran Stanić

Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.


Sign in / Sign up

Export Citation Format

Share Document