Abstract
Let G be a graph and L(G) be the Laplacian matrix of G. In this paper, we explicitly determine the multiplicity of Laplacian eigenvalue 2 for any unicyclic graph containing a perfect matching.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have