Remarks on Bounds of Normalized Laplacian Eigenvalues of Graphs
Abstract
Let G be a connected undirected graph with n, n 3, vertices and m edges. Denote by 1 2 ·s > n =0 the normalized Laplacian eigenvalues of G. Upper and lower bounds of i, i=1,2,… , n-1, are determined in terms of n and general Randi\' c index, R-1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.