Trace-minimal graphs and D-optimal weighing designs
From MaRDI portal
Publication:2576216
DOI10.1016/j.laa.2005.06.027zbMath1085.62087OpenAlexW2152476623MaRDI QIDQ2576216
Publication date: 27 December 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.06.027
strongly regular graphgeneralized polygonsgirthregular graphcagestrace-minimal graphD-optimal weighing design
Optimal statistical designs (62K05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36)
Related Items
\(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings, The trace-minimal graph with \(2v\) vertices and regularity \(v+1\), D-optimal \((0,1)\)-weighing designs for eight objects, D-optimal (0,1)-weighing designs for 10 objects
Cites Work
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- Algebraic matching theory
- Notes on D-optimal designs
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- Numbers of cubic graphs
- D-optimal Designs for Seven Objects and a Large Number of Weighings
- Fast generation of cubic graphs
- Some Improvements in Weighing and Other Experimental Techniques
- On Hotelling's Weighing Problem
- \(D\)-optimal weighing designs for six objects.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
