Abstract
A simple graph is reflexive if the second largest eigenvalue of its (0, 1)- adjacency matrix does not exceed 2. A vertex of the cycle of unicyclic simple graph is said to be loaded if its degree is greater than 2. In this paper we establish that the length of the cycle of unicyclic reflexive graph with seven loaded vertices is at most 10 and find all such graphs with the length of the cycle 10, 9 and 8.
Sign-in/Register to access full text options 
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.
