Perfect codes in \(m\)-Cayley hypergraphs
From MaRDI portal
Publication:6611056
DOI10.1016/j.dam.2024.06.041zbMATH Open1547.05128MaRDI QIDQ6611056
Kantapong Wannatong, Yotsanan Meemark
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Cites Work
- Cayley, Marty and Schreier hypergraphs
- Efficient dominating sets in Cayley graphs.
- Algebraic degree of spectra of Cayley hypergraphs
- On subgroup perfect codes in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Perfect codes in graphs
- On the subgroup perfect codes in Cayley graphs
- Independent perfect domination sets in Cayley graphs
- Perfect Codes in Cayley Graphs
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
- Subgroup Perfect Codes in Cayley Graphs
- Characterizing subgroup perfect codes by 2-subgroups
This page was built for publication: Perfect codes in \(m\)-Cayley hypergraphs