On the second smallest and the largest normalized Laplacian eigenvalues of a graph
classification
🧮 math.CO
keywords
graphlaplaciannormalizedlambdamathcalmatrixsmallestbehaviors
read the original abstract
Let $G$ be a simple connected graph with order $n$. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$. Let $\lambda_{k}(G)$ be the $k$-th smallest normalized Laplacian eigenvalue of $G$. Denote $\rho(A)$ the spectral radius of the matrix $A$. In this paper, we study the behaviors of $\lambda_{2}(G)$ and $\rho(\mathcal{L}(G))$ when the graph is perturbed by three operations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.