Abstract
We give and prove group-theoretic lemmas which would enable one to find the non-isomorphism classes of the (n × n) / k semi-Latin squares. These lemmas are most useful when the sizes and number of semi-Latin squares under consideration are large, and the computing method via the ‘nauty package' for finding their isomorphism classes, given by Bailey and Chigbu, is not readily available. Global Journal of Pure and Applied Sciences Volume , No 1 January (2001) pp. 189-198 KEY WORDS: Concurrence parameters, enumeration, semi-Latin square, non-isomorphism, Trojan square.
Highlights
Summary
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have