Abstract
Given a combinatorial design D with block set B , its block-intersection graph G D is the graph having vertex set B such that two vertices b 1 and b 2 are adjacent if and only if b 1 and b 2 have non-empty intersection. In this paper, we prove that if D is a balanced incomplete block design, BIBD( v, k, λ), with arbitrary index λ, then G D contains a cycle of each length ℓ=3,4,…,|V(G D )| .
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.
