Covering Arrays on Graphs : Qualitative Independence Graphs and Extremal Set Partition Theory

@inproceedings{Meagher2005CoveringAO,
  title={Covering Arrays on Graphs : Qualitative Independence Graphs and Extremal Set Partition Theory},
  author={Karen Meagher},
  year={2005}
}
There has been a good deal of research on covering arrays over the last 20 years. Most of this work has focused on constructions, applications and generalizations of covering arrays. The main focus of this thesis is a generalization of covering arrays, covering arrays on graphs. The original motivation for this generalization was to improve applications of covering arrays to testing systems and networks, but this extension also gives us new ways to study covering arrays. Two vectors v, w in Zk… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 74 references

Independent Sets In Association Schemes

Combinatorica • 2006
View 9 Excerpts
Highly Influenced

Orthogonal Arrays

A. S. Hedayat, N.J.A. Sloane, J. Stufken
Springer Series in Statistics. Springer-Verlag, New York • 1999
View 4 Excerpts
Highly Influenced

Lower Bounds for Transversal Covers

Des. Codes Cryptography • 1998
View 12 Excerpts
Highly Influenced

On the maximum number of qualitatively independent partitions

J. Comb. Theory, Ser. A • 1989
View 6 Excerpts
Highly Influenced

The exact bound in the Erdös - Ko - Rado theorem

Combinatorica • 1984
View 4 Excerpts
Highly Influenced

Independent Sets and Eigenvalues

M. W. Newman
PhD thesis, University of Waterloo, Waterloo • 2004
View 5 Excerpts
Highly Influenced

Algebraic Graph Theory

Graduate texts in mathematics • 2001
View 9 Excerpts
Highly Influenced

Intersecting Systems

Combinatorics, Probability & Computing • 1997
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…