2017/12/27 by John Lorch, Lorch, John
Computer Science · Engineering · Mathematics · #05B30 #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.CO #msc:05B30
paper · pdf · doi:10.48550/arxiv.1712.09602
20 pages
arxiv created 2017/12/27 · openalex publication_date 2017/12/27 · arxiv updated 2017/12/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For prime p we define magic squares of order kp3, called type-p Franklin squares, whose properties specialize to those of classical Franklin squares in the case p=2. We construct type-p Franklin squares in prime-power orders.