×

Perfect codes in \(m\)-Cayley hypergraphs. (English) Zbl 07919056

Summary: Let \(G\) be a finite group with the identity \(e\) and \(S\) be a subset of \(G \smallsetminus \{e \}\) such that \(S = S^{- 1}\). Let \(m\) be an integer such that \(2 \leq m \leq \max \{ o ( s ) \mid s \in S \}\), where \(o ( s )\) is the order of \(s\) in \(G\). The \(m\)-Cayley hypergraph \(\mathcal{H}\) of \(G\) over \(S, m - \operatorname{Cay} ( G , S )\), is a hypergraph with vertex set \(G\) and an edge set \(\{ \{ s^i x \mid 0 \leq i \leq m - 1 \} \mid x \in G , s \in S \} \). We discover a necessary and sufficient condition for a subset \(S\) of \(G \smallsetminus \{ e \}\) such that a subgroup \(H\) is a perfect code in \(m - \operatorname{Cay} ( G , S )\) and obtain some conditions for a subgroup \(H\) that guarantee the existence of a subset \(S \subseteq G \smallsetminus \{ e \}\) such that \(H\) is a perfect code in \(m - \operatorname{Cay} ( G , S )\).

MSC:

05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
05C65 Hypergraphs
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
94B25 Combinatorial codes
Full Text: DOI

References:

[1] Biggs, N. L., Perfect codes in graphs, J. Combin. Theory Ser. B, 15, 289-296, 1973 · Zbl 0256.94009
[2] Brandstadt, A.; Leitert, A.; Rautenbach, D., Efficient dominating and edge dominating sets for graph and hypergraphs, Comput. Sci., 7676, 267-277, 2012 · Zbl 1260.05108
[3] Bretto, A., Hypergraph Theory: An Introduction, 2003, Springer: Springer New York
[4] Buratti, M., Cayley, Marty and Schreier hypergraphs, Abh. Math. Semin. Univ. Hambg., 64, 151-162, 1994 · Zbl 0820.05049
[5] Chen, J.; Wang, Y.; Xia, B., Characterization of subgroup perfect codes in Cayley graphs, Discrete Math., 343, Article 111813 pp., 2020 · Zbl 1439.05104
[6] Dejter, I. J.; Serra, O., Efficient dominating sets in Cayley graphs, Discrete Appl. Math., 129, 319-328, 2003 · Zbl 1035.05060
[7] Huang, H.; Xia, B.; Zhou, S., Perfect codes in Cayley graphs, SIAM J. Discrete Math., 32, 1, 548-559, 2018 · Zbl 1381.05032
[8] Khaefi, Y.; Akhlaghi, Z.; Khosravi, B., On subgroup perfect codes in Cayley graphs, Des. Codes Crytogr., 91, 55-61, 2023 · Zbl 1506.05090
[9] Lee, J., Independent perfect domination sets in Cayley graphs, J. Graph Theory, 37, 213-219, 2001 · Zbl 0996.05096
[10] Ma, X.; Walls, G. L.; Wang, K.; Zhou, S., Subgroup perfect codes in Cayley graphs, SIAM J. Discrete Math., 34, 3, 1909-1921, 2020 · Zbl 1453.05045
[11] Shalageh, F.; Assari, A.; Halali, A.; Khazaei, F., Operation on Cayley hypergraphs, Far East J. Math. Sci., 103, 1575-1585, 2018
[12] Sripaisan, N.; Meemark, Y., Algebraic degree of spectra of Cayley hypergraphs, Discrete Appl. Math., 316, 87-94, 2022 · Zbl 1490.05171
[13] Zhang, J., Characterizing subgroup perfect codes by 2-subgroups, Des. Codes Cryptogr., 91, 2811-2819, 2023 · Zbl 1520.05050
[14] Zhang, J.; Zhou, S., On subgroup perfect codes in Cayley graphs, European J. Combin., 91, Article 103228 pp., 2021 · Zbl 1459.05126
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.