Abstract
The existence problem of the orthogonal double covers of the graphs is a well-known problem in the theory of combinatorial designs. In this paper, we construct the orthogonal double covers of the complete bipartite graph by the disjoint union of paths, copies of a caterpillar, copies of a certain path, and by other certain defined graph. We use the vector method as a helping tool for constructing our results, the advantage of this method is that it is accessible to discrete mathematicians not intimately familiar with the theory of the orthogonal double covers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Menoufia Journal of Electronic Engineering Research
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.