Abstract
Quasi-symmetric designs (QSDs) with particular block graphs are investigated. We rule out the possibility of a QSD with block graph that has the same parameters as that of the Symplectic graph Sp(2t, q), where q is an odd prime power or its complement. We obtain support for Bagchi’s recent conjecture, which states that ‘For the existence of a quasi-symmetric 2-design with block graph \(K_{m\times n}\), we must have \(m \equiv n+ 1 \pmod {n^2}\)’. Under certain conditions, we rule out the possibility of a QSD having a pseudo-Latin square or negative Latin square block graph.
Similar content being viewed by others
References
Bagchi B.: Parametric restrictions on quasi-symmetric designs. Eur. J. Comb. 99, 103434 (2022).
Cameron P., Goethals J., Seidel J.: Strongly regular graphs having strongly regular subconstituents. J. Algebra 55(2), 257–280 (1978).
Goethals J.M., Seidel J.J.: Strongly regular graphs derived from combinatorial designs. Can. J. Math. 22, 597–614 (1970).
Mavron V.C., McDonough T.P., Shrikhande M.S.: On quasi-symmetric designs with intersection difference three. Des. Codes Cryptogr. 63(1), 73–86 (2012).
Pawale R.M.: Quasi-symmetric designs with fixed difference of block intersection numbers. J. Comb. Des. 15(1), 49–60 (2007).
Pawale R.M.: Quasi-symmetric designs with the difference of block intersection numbers two. Des. Codes Cryptogr. 58(2), 111–121 (2011).
Pawale R.M., Shrikhande M.S., Nyayate S.M.: Conditions for the parameters of the block graph of quasi-symmetric designs. Electron. J. Comb. 22(1), 1–36 (2015).
Pawale R.M., Shrikhande M.S., Nyayate S.M.: Non-derivable strongly regular graphs from quasi-symmetric designs. Discret. Math. 339(2), 759–769 (2016).
Sane S.S., Shrikhande M.S.: Quasi-symmetric \(2,3,4\)-designs. Combinatorica 7(3), 291–301 (1987).
Scott L.L.: A condition on Higman’s parameters. Notices Am. Math. Soc. 20, 1–97 (1973).
Shrikhande S.S., Bhagwandas: Duals of incomplete block designs. J. Indian Stat. Assoc. 3, 30–37 (1965).
Shrikhande M.S., Sane S.S.: Quasi-symmetric Designs, vol. 164. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1991).
Wolfram. Mathematica: A computer algebra system. Version 5., 1988. http://www.wolfram.com/mathematica/.
Acknowledgements
The authors would like to thank the anonymous referee for suggesting improvements on the earlier stated results.
Author information
Authors and Affiliations
Additional information
Communicated by K. T. Arasu.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pawale, R.M., Shrikhande, M.S. & Rajbhar, K.S. Non-existence of quasi-symmetric designs with restricted block graphs. Des. Codes Cryptogr. 90, 871–879 (2022). https://doi.org/10.1007/s10623-022-01016-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01016-4