Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9516053 | Journal of Combinatorial Theory, Series B | 2005 | 18 Pages |
Abstract
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 we ask is, are there graphs with CAN(G,g)
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Karen Meagher, Brett Stevens,