Non-existence of quasi-symmetric designs with restricted block graphs
From MaRDI portal
Publication:2119939
DOI10.1007/s10623-022-01016-4zbMath1487.05034OpenAlexW4214551665WikidataQ114849782 ScholiaQ114849782MaRDI QIDQ2119939
Rajendra M. Pawale, Kusum S. Rajbhar, Mohan S. Shrikhande
Publication date: 31 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01016-4
Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Quasi-symmetric designs with the difference of block intersection numbers two
- On quasi-symmetric designs with intersection difference three
- Non-derivable strongly regular graphs from quasi-symmetric designs
- Quasi-symmetric 2,3,4-designs
- Strongly regular graphs having strongly regular subconstituents
- Parametric restrictions on quasi-symmetric designs
- Conditions for the parameters of the block graph of quasi-symmetric designs
- Quasi-symmetric designs with fixed difference of block intersection numbers
- Strongly Regular Graphs Derived from Combinatorial Designs
This page was built for publication: Non-existence of quasi-symmetric designs with restricted block graphs