Cameron-Liebler sets in Hamming graphs

2020/05/03 by Jun Guo, Guo, Jun, Lingyu Wan +1
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2005.02227

openalex publication_date 2020/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we discuss Cameron-Liebler sets in Hamming graphs, obtain several equivalent definitions and present all classification results.

Related

• A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
• Cameron-Liebler sets in bilinear forms graphs
• Cameron-Liebler sets of k-spaces in PG(n,q)
• A note on the automorphism group of the Hamming graph
• Sensitivity and Hamming graphs