Lower bounds for the least Laplacian eigenvalue of unbalanced blocks

摘要

We denote by n and mu(n), the number of vertices and the least Laplacian eigenvalue of a signed graph, respectively. A connected unbalanced signed graph without cut-vertices is called an unbalanced block. We prove that