Perfect codes in commuting graphs of symmetric groups

DOI10.12386/a20210157MaRDI QIDQ6665930

Guo Zhong, Kaishun Wang, Xuan Long Ma

Publication date: 17 January 2025

Published in: Acta Mathematica Sinica. Chinese Series (Search for Journal in Brave)

zbMATH Keywords

symmetric groupalternating groupperfect codecommuting graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient dominating sets in circulant graphs with domination number prime
• Perfect codes in circulant graphs
• On groups of even order
• Subgroup perfect codes in Cayley sum graphs
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Perfect codes over graphs
• Coloring of commutative rings
• Efficient dominating sets in Cayley graphs.
• Desiderata and suggestions. No. 1: The theory of groups. No. 2: Graphical representation.
• Perfect codes in Cayley sum graphs
• Non-commuting graph of a group.
• On the commuting probability in finite groups.
• Independent perfect domination sets in Cayley graphs
• Commuting probabilities of finite groups
• Diameters and Eigenvalues
• Perfect Codes in Cayley Graphs
• Subgroup Perfect Codes in Cayley Graphs
• Perfect codes in proper reduced power graphs of finite groups

This page was built for publication: Perfect codes in commuting graphs of symmetric groups