Total perfect codes in Cayley graphs

被引：30
|
作者：
Zhou, Sanming [1 ]
机构：
[1] Univ Melbourne, Sch Math & Stat, Parkville, Vic 3010, Australia
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2016年 / 81卷 / 03期
基金：
澳大利亚研究理事会;
关键词：
Perfect code; Total perfect code; Efficient dominating set; Efficient open dominating set; Total perfect dominating set; Cayley graph; EFFICIENT DOMINATION; SETS;
D O I：
10.1007/s10623-015-0169-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A total perfect code in a graph Gamma is a subset C of V(Gamma) such that every vertex of Gamma is adjacent to exactly one vertex in C. We give necessary and sufficient conditions for a conjugation-closed subset of a group to be a total perfect code in a Cayley graph of the group. As an application we show that a Cayley graph on an elementary abelian 2-group admits a total perfect code if and only if its degree is a power of 2. We also obtain necessary conditions for a Cayley graph of a group with connection set closed under conjugation to admit a total perfect code.
引用
收藏
页码：489 / 504
页数：16
相关论文
共 50 条
  • [41] Perfect 1-Factorizations of a Family of Cayley Graphs
    Herke, Sarada
    Maenhaut, Barbara
    JOURNAL OF COMBINATORIAL DESIGNS, 2015, 23 (09) : 369 - 399
  • [42] Perfect State Transfer on Weighted Abelian Cayley Graphs
    Xiwang Cao
    Keqin Feng
    Ying-Ying Tan
    Chinese Annals of Mathematics, Series B, 2021, 42 : 625 - 642
  • [43] Perfect State Transfer on Weighted Abelian Cayley Graphs
    Xiwang CAO
    Keqin FENG
    Ying-Ying TAN
    ChineseAnnalsofMathematics,SeriesB, 2021, (04) : 625 - 642
  • [44] Perfect State Transfer on Weighted Abelian Cayley Graphs
    Cao, Xiwang
    Feng, Keqin
    Tan, Ying-Ying
    CHINESE ANNALS OF MATHEMATICS SERIES B, 2021, 42 (04) : 625 - 642
  • [45] A characterization of some types of Cayley graphs and addition Cayley graphs and their total chromatic numbers
    Momrit, Puttipong
    Promsakon, Chanon
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2024, 27 (03): : 963 - 981
  • [46] Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein–Jacobi integers and Lipschitz integers
    Jon-Lark Kim
    JunYong Park
    Designs, Codes and Cryptography, 2022, 90 : 2967 - 2989
  • [47] Perfect codes in some products of graphs
    Bakaein, Samane
    Tavakoli, Mostafa
    Rahbarnia, Freydoon
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2021, 9 (01) : 175 - 184
  • [48] Additive perfect codes in Doob graphs
    Shi, Minjia
    Huang, Daitao
    Krotov, Denis S.
    DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (08) : 1857 - 1869
  • [49] On perfect codes in Cartesian products of graphs
    Mollard, Michel
    EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (03) : 398 - 403
  • [50] Additive perfect codes in Doob graphs
    Minjia Shi
    Daitao Huang
    Denis S. Krotov
    Designs, Codes and Cryptography, 2019, 87 : 1857 - 1869
12345