Abstract
In this paper it is shown, using the Sieve formula, that the number of open chains of length k, k ⩾ 5, in a self-complementary (s.c.) graph is always even. As a corollary, it follows that the number of hamiltonian chains in a s.c. graph of order p > 5 is even, a result proved earlier by Camion. Further, the minimum number and the maximum number of open chains of length 3 in s.c. graphs of order p are determined, and the s.c. graphs of order p which attain these bounds are characterized.
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.
