The covering radius of the cycle code of a graph

DOI10.1016/0166-218X(93)90140-JzbMath0778.94008WikidataQ126351285 ScholiaQ126351285MaRDI QIDQ686525

Patrick Solé, Thomas Zaslavsky

Publication date: 2 December 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering radiuscharacteristic vectors of circuitcycle code

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Cyclic codes (94B15)

Related Items

Eulerian ideals ⋮ Complexity of circuit intersection in graphs ⋮ Joins, ears and Castelnuovo-Mumford regularity ⋮ Decreasing behavior of the depth functions of edge ideals ⋮ Fault-detection in networks ⋮ Lit-only sigma game on a line graph ⋮ Associated primes of powers of edge ideals and ear decompositions of graphs ⋮ Maximality of the cycle code of a graph

Cites Work

• On the covering radius of cyclic linear codes and arithmetic codes
• Matching theory
• Maximality of the cycle code of a graph
• Conservative weightings and ear-decompositions of graphs
• Über den Zusammenhang symmetrischer Graphen
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• On the covering radius of codes
• On the complexity of some coding problems (Corresp.)
• Graph theoretic error-correcting codes
• Connectivity of transitive graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The covering radius of the cycle code of a graph