Abstract
An orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection ** = {Gi|i = 1,2, . . . ,n} of spanning subgraphs of Kn, all isomorphic to G, with the property that every edge of Kn belongs to exactly two members of ** and any two distinct members of ** share exactly one edge. A caterpillar of diameter five is a tree arising from a path with six vertices by attaching pendant vertices to some or each of its vertices of degree two. We show that for any caterpillar of diameter five there exists an ODC of the complete graph Kn.
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.
