Add to ORKGAbstract. A total perfect code in a graph is a subset of the graph’s vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove that the tensor product of any number of simple graphs has a total perfect code if and only if each factor has a total perfect code.
A contribution is made to the classification of lattice-like total perfect codes in integer lattices...
AbstractIn this paper perfectness of various products of graphs is considered. The Cartesian product...
The set of codewords for a standard error-correcting code can be viewed\ud as subset of the vertices...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
Abstract. A perfect r-code in a graph is a subset of the graph’s vertices with the property that eac...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
An r-perfect code of a graph G = (V,E) is a set C ⊆ V such that the r-balls centered at vertices of ...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
The study of graph properties has gathered many attentions in the past years. The graph properties t...
We reveal an equivalence relation between the construction of a new class of low density MDS array c...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
A contribution is made to the classification of lattice-like total perfect codes in integer lattices...
AbstractIn this paper perfectness of various products of graphs is considered. The Cartesian product...
The set of codewords for a standard error-correcting code can be viewed\ud as subset of the vertices...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
Abstract. A perfect r-code in a graph is a subset of the graph’s vertices with the property that eac...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
An r-perfect code of a graph G = (V,E) is a set C ⊆ V such that the r-balls centered at vertices of ...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
The study of graph properties has gathered many attentions in the past years. The graph properties t...
We reveal an equivalence relation between the construction of a new class of low density MDS array c...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
A contribution is made to the classification of lattice-like total perfect codes in integer lattices...
AbstractIn this paper perfectness of various products of graphs is considered. The Cartesian product...
The set of codewords for a standard error-correcting code can be viewed\ud as subset of the vertices...