Abstract
In this paper, we give a characterization of regular two-graphs of order n in terms of spectral data of two-graphs of order n−1 and n−2. Moreover, we prove that a two-graph of order n is regular if and only if all its induced sub-two-graphs with n−2 vertices have the same characteristic polynomial.
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 callSimilar Papers
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.
