2000 character limit reached
Remarks on Bounds of Normalized Laplacian Eigenvalues of Graphs (1506.05762v1)
Published 18 Jun 2015 in math.SP
Abstract: Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$, are determined in terms of $n$ and general Randi\' c index, $R_{-1}$.
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.