Abstract
Let [Formula: see text] be the set of connected unicyclic graphs of order [Formula: see text] and girth [Formula: see text]. Let [Formula: see text] be obtained from a cycle [Formula: see text] (in an anticlockwise direction) by identifying [Formula: see text] with the root of a rooted tree [Formula: see text] of order [Formula: see text] for each [Formula: see text], where [Formula: see text] and [Formula: see text]. In this note, the graph with the minimal least eigenvalue (and the graph with maximal spread) in [Formula: see text] is determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.