A perfect code in a graph \Gamma = (V, E) is a subset C of V that is an independent set such that every vertex in V \setminus C is adjacent to exactly one vertex in C. A total perfect code in \Gamma is a subset C of V such that every vertex of V is adjacent to exactly one vertex in C.
Mar 25, 2017
People also ask
What is the perfect code of a graph?
What are circulant graphs?
What is the chromatic number of a circulant graph?
A perfect code in a graph Γ = ( V , E ) is a subset C of V that is an independent set such that every vertex in V ∖ C is adjacent to exactly one vertex in C ...
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \setminus C$ is adjacent to ...
Oct 22, 2024 · A perfect code in a graph Γ = ( V , E ) \Gamma = (V, E) is a subset C C of V V that is an independent set such that every vertex in V ∖ C V ...
A perfect code in a graph =(V,E) is a subset C of V that is an independent set such that every vertex in VC is adjacent to exactly one vertex in C. A total ...
Mar 25, 2017 · Abstract. A perfect code in a graph Γ=(V,E) is a subset C of V that is an independent set such that every vertex in V \ C is adjacent to ...
Semantic Scholar extracted view of "Perfect codes in circulant graphs" by Rongquan Feng et al ... This paper studies perfect codes and total perfect codes in ...
A perfect code in a graph Γ=(V,E) is a subset C of V that is an independent set such that every vertex in V∖C is adjacent to exactly one vertex in C.
We then build perfect group codes of length one for this metric by solving a graph-theoretical problem over circulant graphs, the perfect dominating set problem ...
It is shown that to determine if a graph has a perfect 1-error-correcting code is an NP-complete problem. The set of codewords for a standard ...