AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We show an infinite family of 1-perfect codes in second powers of graphs and we prove the nonexistence of nontrivial 1-perfect codes over complete bipartite graphs with at least three vertices
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
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...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
The set of codewords for a standard error-correcting code can be viewed\ud as subset of the vertices...
Abstract. A total perfect code in a graph is a subset of the graph’s vertices with the property that...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
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...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
The set of codewords for a standard error-correcting code can be viewed\ud as subset of the vertices...
Abstract. A total perfect code in a graph is a subset of the graph’s vertices with the property that...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractA perfect one-error-correcting code on a graph is a subset of the vertices so that no two ve...
A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every...
DOI
Add to ORKG