On the second smallest and the largest normalized Laplacian eigenvalues of a graph

Abstract

Let G be a simple connected graph with order n. Let L(G) be the normalized Laplacian matrix of G. Let λk(G) be the k-th smallest normalized Laplacian eigenvalue of G. Denote (A) the spectral radius of the matrix A. In this paper, we study the behaviors of λ2(G) and (L(G)) when the graph is perturbed by three operations.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…