Abstract
Let G be a mixed graph and L(G) be the Laplacian matrix of the mixed graph G. The first eigenvalue of G is referred to the least nonzero eigenvalue of L(G). Let MG(n,k) be the set of nonsingular mixed graphs with n vertices and k pendant vertices, where n≥4. In this paper, up to a signature matrix, we determine the unique graph with the minimal first eigenvalue among all graphs in MG(n,k). Thus we obtain a lower bound for the first eigenvalue of a mixed graph in terms of the number of pendant vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
