Opening book details…
Can I read Covering Arrays on Graphs on EtoBox?
Covering Arrays on Graphs by Karen Meagher; Brett Stevens is a Computer Science article available to read on EtoBox.
What is Covering Arrays on Graphs about?
Two vectors v, w in Z n g are qualitatively independent if for all pairs (a, b) ∈ Z g ×Z g there is a position i in the vectors where array on Z g 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 The question we ask is, are there graphs with CAN(G, g) < CAN(K (G) , g)? We find an infinite family of graphs that satisfy this inequality. Further we define a family of graphs QI (n, g) that have the property that there exists a CAN (n, G, g) if and only if there is a homomorphism to QI (n, g). Hence, the family of graphs QI (n, g) defines a generalized colouring. For QI (n, 2), we find a formula for both the chromatic and clique number and determine two necessary conditions for CAN(G, 2) < CAN(K (G) , 2). We also find the cores of all the QI (n, 2) and use this to prove that the rows of any covering array with g = 2 can be assumed to have the same number of 1's.
Who reads Covering Arrays on Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Karen Meagher; Brett Stevens
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0095-8956)
- Published
- 2005
- Language
- EN
- Field
- Computer Science (Physical Sciences)