Total perfect codes in Cayley graphs
type: Item
instance of: scholarly article
title: Total perfect codes in Cayley graphs
zbMATH Open document ID: 1347.05097
author: Sanming Zhou
published in: Designs, Codes and Cryptography
publication date: 2016-10-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1601.03471
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 6642092
zbMATH Keywords: perfect code
zbMATH Keywords: total perfect code
zbMATH Keywords: efficient dominating set
zbMATH Keywords: efficient open dominating set
zbMATH Keywords: total perfect dominating set
zbMATH Keywords: Cayley graph
MaRDI profile type: Publication
OpenAlex ID: W3099058551
arXiv ID: 1601.03471
cites work: On perfect codes and related concepts
cites work: Lattice-like total perfect codes
cites work: On perfect codes in the Hamming schemes H(n,q) with q arbitrary
cites work: Perfect codes in graphs
cites work: Odd neighborhood transversals on grid graphs
cites work: Perfect domination in regular grid graphs
cites work: Efficient dominating sets in Cayley graphs.
cites work: Q5707657
cites work: Perfect codes and regular partitions in graphs and groups
cites work: Product Constructions for Perfect Lee Codes
cites work: Q5551256
cites work: Q3413877
cites work: Q3070313
cites work: Q2716030
cites work: Perfect codes in the graphs \(O_k\)
cites work: Q4368728
cites work: Perfect Codes in Antipodal Distance-Transitive Graphs.
cites work: A survey of perfect codes
cites work: 1-perfect codes in Sierpiński graphs
cites work: Q5480690
cites work: Efficient domination in cubic vertex-transitive graphs
cites work: Perfect codes over graphs
cites work: Open k-monopolies in graphs: complexity and related concepts
cites work: Independent perfect domination sets in Cayley graphs
cites work: Perfect codes on the towers of Hanoi graph
cites work: Q5284096
cites work: Perfect Codes for Metrics Induced by Circulant Graphs
cites work: Perfect Codes From Cayley Graphs Over Lipschitz Integers
cites work: On perfect codes in Cartesian products of graphs
cites work: Efficient domination in circulant graphs with two chord lengths
cites work: On the chromatic number of cube-like graphs
cites work: Efficient domination in circulant graphs
cites work: Q4317890
cites work: Codes and anticodes in the Grassman graph
cites work: Perfect codes in direct products of cycles
cites work: An improved version of Lloyd's theorem
cites work: Perfect codes in the graphs Ok and L(Ok)
cites work: Perfect codes in \(\mathrm{SL}(2,2^f)\)
cites work: Perfect codes in direct products of cycles-a complete characterization
cites work: Cyclotomic graphs and perfect codes
DOI: 10.1007/S10623-015-0169-0
Recommended article: Perfect Codes in Cayley Graphs
Recommended article: Perfect codes in Cayley sum graphs
Recommended article: Perfect t-codes in Cayley graphs of groups
Recommended article: Perfect Codes From Cayley Graphs Over Lipschitz Integers
Recommended article: Q4207865
Recommended article: Q4892794
Recommended article: Perfect codes in graphs
Recommended article: Perfect codes in circulant graphs
Recommended article: Subgroup Perfect Codes in Cayley Graphs
Recommended article: On subgroup perfect codes in Cayley graphs
description: scientific article