2010/12/10 by Tao Feng, Fan Wu, Feng, Tao +3 · 1 citation
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1012.2181
12 pages, corrected typos
openalex publication_date 2010/12/10 · arxiv created 2011/10/06 · arxiv updated 2011/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov's conjecture by Ikuta and Munemasa [15].