Abstract
Mixed graphs are graphs whose edges may be directed or undirected. The first eigenvalue of a mixed graph is the least nonzero eigenvalue of its Laplacian matrix. We determine the unique mixed graphs with minimum first eigenvalue over all nonsingular mixed unicyclic graphs with fixed number of branch vertices, and the unique graph with minimum least signless Laplacian eigenvalue over all nonbipartite unicyclic graphs with fixed number of branch 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.
