Abstract
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on n vertices. Two conjectures are stated, one using these numerical measures and the other using the deck of a graph, which suggest that there is a finite set of conditions differentiating two-graphs. We verify that among the four non-trivial non-isomorphic regular two-graphs on 26 vertices that both conjectures hold.
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.
