1 research outputs found

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

    Full text link
    Let GG be a simple connected graph with order nn. Let L(G)\mathcal{L}(G) be the normalized Laplacian matrix of GG. Let λk(G)\lambda_{k}(G) be the kk-th smallest normalized Laplacian eigenvalue of GG. Denote ρ(A)\rho(A) the spectral radius of the matrix AA. In this paper, we study the behaviors of λ2(G)\lambda_{2}(G) and ρ(L(G))\rho(\mathcal{L}(G)) when the graph is perturbed by three operations.Comment: 14 pages, 3 figure
    corecore