The covering radius of the cycle code of a graph

https://doi.org/10.1016/0166-218X(93)90140-JGet rights and content
Under an Elsevier user license
open archive

Abstract

The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We exploit a connection between the covering radius of this code and minimum T-joins. We obtain a lower bound on the covering radius which is met with equality when the graph is Hamiltonian or is regular and has edge connectivity equal to its degree. We also solve several other examples and we note some cycle codes which are optimal for the covering problem.

Cited by (0)

Now at CNRS, 13S, Bât. 4, 250 rue Albert Einstein, Sophia Antipolis, 06560 Valbonne, France.

∗∗

Research supported by the National Science Foundation under grant DMS-8808239.