Abstract
The signature s(G) of a graph G is defined as the difference between its positive inertia index and negative inertia index. In 2013, H. Ma et al. ([1]) conjectured that −c3(G)≤s(G)≤c5(G) for an arbitrary simple graph G, where c3(G) denotes the number of cycles in G of length 3 modulo 4, c5(G) denotes the number of cycles in G of length 1 modulo 4. In this paper, we prove that this conjecture holds for claw-free graphs and graphs with least eigenvalue ≥−2.
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.
