Covering arrays on graphs

@article{Meagher2005CoveringAO,
  title={Covering arrays on graphs},
  author={Karen Meagher and Brett Stevens},
  journal={J. Comb. Theory, Ser. B},
  year={2005},
  volume={95},
  pages={134-151}
}
Two vectors v, w in Zgn are qualitatively independent if for all pairs (a, b) ∈ Zg × Zg there is a position i in the vectors where (a, b) = (vi, wi). A covering array on a graph G, CA (n, G, g), is a |V(G)| × n array on Zg with the property that any two rows which correspond to adjacent vertices in G are qualitatively independent. The smallest possible n is denoted by CAN(G, g). These are an extension of covering arrays. It is known that CAN(Kω(G), g) ≤ CAN(G, g) ≤ CAN(Kχ(G), g). The question… CONTINUE READING
BETA

Topics from this paper.

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Binary Covering Arrays on Tournaments

VIEW 7 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Graph-dependent Covering Arrays and LYM Inequalities

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Mixed Covering Arrays on 3-Uniform Hypergraphs

  • Discrete Applied Mathematics
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Survey of Binary Covering Arrays

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Covering Arrays on Product Graphs

  • Graphs and Combinatorics
  • 2015
VIEW 2 EXCERPTS
CITES BACKGROUND

On optimal binary codes with unbalanced coordinates

  • Applicable Algebra in Engineering, Communication and Computing
  • 2013