Abstract
As part of our main result we prove that the blocks of any sufficiently large BIBD(v, 4, λ) can be circularly ordered so that consecutive blocks intersect in exactly one point, i.e., that the 1-block-intersection graphs of such designs are Hamiltonian. In fact, we prove that such graphs are Hamilton-connected. We also consider {1, 2}-block-intersection graphs, in which adjacent vertices have either one or two points in common between their corresponding blocks. These graphs are Hamilton-connected for all sufficiently large BIBD(v, k, λ) with \({k \in \{4,5,6\}}\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alspach B., Hare D.: Edge-pancyclic block-intersection graphs. Discrete Math. 97, 17–24 (1991)
Alspach B., Heinrich K., Mohar B.: A note on Hamilton cycles in block-intersection graphs. In: Finite Geometries and Combinatorial Designs—Contemporary Mathematics, vol. 111, pp. 1–4, American Mathematical Society in Providence, Rhode Island (1990).
Case G.A., Pike D.A.: Pancyclic PBD block-intersection graphs. Discrete Math. 308, 896–900 (2008)
Chvátal V., Erdős P.: A note on Hamiltonian circuits. Discrete Math. 2, 111–113 (1972)
Colbourn, C.J., Dinitz, J.H. (eds): Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Colbourn M.J., Johnstone J.K.: Twofold triple systems with a minimal change property. Ars Combin. 18, 151–160 (1984)
Dewar M.: Gray codes, universal cycles and configuration orderings for block designs. PhD Thesis, Carleton University (2007).
Graham R.L., Knuth D.E., Patashnik O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edition. Addison-Wesley Publications, Reading (1994)
Hare D.R.: Cycles in the block-intersection graph of pairwise balanced designs. Discrete Math. 137, 211–221 (1995)
Horák P., Pike D.A., Raines M.E.: Hamilton cycles in block-intersection graphs of triple systems. J. Combin. Des. 7, 243–246 (1999)
Horák P., Rosa A.: Decomposing Steiner triple systems into small configurations. Ars Combin. 26, 91–105 (1988)
Jesso A.T.: The Hamiltonicity of block-intersection graphs of balanced incomplete block designs. MSc Thesis, Memorial University of Newfoundland (2010).
Mahmoodian E.S.: The intersection graph of B[3, 2; 6] is the Petersen graph. Bull. ICA 4, 110 (1992)
Mamut A., Pike D.A., Raines M.E.: Pancyclic BIBD block-intersection graphs. Discrete Math. 284, 205–208 (2004)
McSorley J.P.: Single-change circular covering designs. Discrete Math. 197/198, 561–588 (1999)
Pike D.A., Vandell R.C., Walsh M.: Hamiltonicity and restricted block-intersection graphs of t-designs. Discrete Math. 309, 6312–6315 (2009)
Stinson D.R.: Combinatorial Designs: Constructions and Analysis. Spinger-Verlag, New York (2004)
van Rees G.H.J.: Single-change covering designs II. Congr. Numer. 92, 29–32 (1993)
Wallis W.D., Yucas J.L., Zhang G.-H.: Single change covering designs. Designs Codes Cryptogr. 3, 9–19 (1993)
Zhang G.-H.: Some new bounds of single-change covering designs. SIAM J. Discrete Math. 7, 166–171 (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. J. Colbourn.
Rights and permissions
About this article
Cite this article
Jesso, A.T., Pike, D.A. & Shalaby, N. Hamilton cycles in restricted block-intersection graphs. Des. Codes Cryptogr. 61, 345–353 (2011). https://doi.org/10.1007/s10623-010-9483-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-010-9483-8