Abstract
A bull is a graph which is obtained by attaching two edges to two vertices of a triangle. A bull-design of order n is an ordered pair (X,A), where X is the vertex set of Kn and A is an edge-disjoint decomposition of Kn into copies of bulls. In this paper, it is shown that a bull-design of order n can be embedded in a bull-design of order m if and only if m≥3n/2+1 or m=n. This produces a generalization of the Doyen–Wilson theorem for bull-designs.
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
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.
