Trace-minimal graphs and D-optimal weighing designs

Linear Algebra and Its Applications

Volumn 412, Issue 2-3, 2006, Pages 161-221

  Ábrego, Bernardo M ^a   Fernández Merchant, Silvia ^a   Neubauer, Michael G ^a   Watkins, William ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Cages; D optimal weighing design; Generalized polygons; Girth; Regular graph; Strongly regular graph; Trace minimal graph

Indexed keywords

MATRIX ALGEBRA; POLYNOMIALS; SET THEORY;

CAGES; D-OPTIMAL WEIGHING DESIGNS; GENERALIZED POLYGONS; GIRTH; REGULAR GRAPH; STRONGLY REGULAR GRAPH; TRACE-MINIMAL GRAPH;

GRAPH THEORY;

EID: 27844489132     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2005.06.027     Document Type: Article

References (25)

1. B. Ábrego, S. Fernández-Merchant, M.G. Neubauer, and W. Watkins D-optimal weighing designs for n ≡ -1 (mod 4) objects and a large number of weighings Linear Algebra Appl. 374 2003 175 218
2. G. Brinkmann Fast generation of cubic graphs J. Graph Theory 23 1996 139 149
3. W.S. Burnside, and A.W. Panton The Theory of Equations with an Introduction to the Theory of Binary Algebra 1960 Dover New York
4. D. Cvetković, M. Doob, and H. Sachs Spectra of Graphs, Theory and Application 1980 Academic Press New York
5. C.J. Colbourn J.H. Dinitz The CRC Handbook of Combinatorial Design 1996 CRC Press Boca Raton
6. H.-J. Finck, and G. Grohmann Vollständiges Produkt, chromatische Zahl und charakteristisches Polynom regulärer Graphen I. Wiss. Z. TH Ilmenau 11 1965 1 3
7. C.D. Godsil Problems in algebraic combinatorics Electron. J. Combin. F1 1995
8. Gordon's Data, < www.cs.uwa.edu.au/~gordon/data.html>.
9. H. Hotelling Some improvements in weighing and other experimental techniques Ann. Math. Statist. 15 1944 297 306
10. M. Hudelson, V. Klee, and D. Larman Largest j-simplices in d-cubes: some relatives of the Hadamard determinant problem Linear Algebra Appl. 241 1996 519 598
11. A.M. Mood On Hotelling's weighing problem Ann. Math. Statist. 17 1946 432 446
12. M. Neubauer, W. Watkins, and J. Zeitlin Notes on D-optimal designs Linear Algebra Appl. 280 1998 109 127
13. M. Neubauer, W. Watkins, and J. Zeitlin Maximal D-optimal weighing designs for 4 and 5 objects Electron. J. Linear Algebra 4 1998 48 72 Available from:
14. M. Neubauer, W. Watkins, and J. Zeitlin D-optimal weighing designs for six objects Metrika 52 2000 185 211
15. M. Neubauer, and W. Watkins D-optimal designs for seven objects and a large number of weighings Linear and Multilinear Algebra 50 2002 61 74
16. F. Pukelsheim Optimal Design of Experiments 1993 Wiley New York
17. N. Pullman, and N. Wormald Regular graphs with prescribed odd girth Utilitas Math. 24 1983 243 251
18. T. Rivlin The Chebyshev Polynomials 1974 Wiley New York
19. R.W. Robinson, and W.C. Wormald Number of cubic graphs J. Graph Theory 7 1983 463 467
20. H. Sachs, Über die Anzahlen von Bäumen, Wäldern und Kreisen gegebenen Typs in gegebenen Graphen, Habilitationsschrift Univ. Halle, Math.-Nat. Fak., 1963.
21. H. Sachs Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom Publ. Math. Debrecen 11 1964 119 134
22. F.W. Stevenson Projective Planes 1972 Freeman San Francisco
23. H. van Maldeghem Generalized Polygons, Monographs in Mathematics vol. 93 1998 Birkhäuser Verlag Basel
24. J.H. van Lint, and R.M. Wilson A Course in Combinatorics 1992 Cambridge University Press Cambridge
25. F. Yates Complex experiments J. Roy. Statist. Soc. Supp. 2 1935 181 247