2000 character limit reached
Cheeger-like inequalities for the largest eigenvalue of the graph Laplace Operator
Published 27 Oct 2019 in math.SP and math.CO | (1910.12233v2)
Abstract: We define a new Cheeger-like constant for graphs and we use it for proving Cheeger-like inequalities that bound the largest eigenvalue of the normalized Laplace operator.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.