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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
Paper Title
Journal
Date
