1. Assmus E.F., Jr., Key J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992) (second printing with corrections, 1993).
2. Balbuena C., Garcia-Vázquez P., Marcote X.: Sufficient conditions for λ′-optimality in graphs with girth g. J. Graph Theory 52, 73–86 (2006)
3. Bauer D., Boesch F., Suffel C., Tindell R.: Connectivity Extremal Problems and the Design of Reliable Probabilistic Networks. The Theory and Applications of Graphs, Kalamazoo MI, pp. 45–54. Wiley, New York (1981).
4. Björner A., Karlander J.: The mod p rank of incidence matrices for connected uniform hypergraphs. Eur. J. Comb. 14, 151–155 (1993)
5. Bondy J.A., Murty U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)