Trace-minimal graphs and D-optimal weighing designs
DOI10.1016/J.LAA.2005.06.027zbMATH Open1085.62087OpenAlexW2152476623MaRDI QIDQ2576216FDOQ2576216
Authors: Yanyan Li 
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
Recommendations
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- \(D\)-optimal weighing designs for six objects.
- D-optimal (0,1)-weighing designs for 10 objects
- D-optimal \((0,1)\)-weighing designs for eight objects
- D-optimal weighing designs for four and five objects
strongly regular graphgirthregular graphcagesgeneralized polygonstrace-minimal graphD-optimal weighing design
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Optimal statistical designs (62K05) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic matching theory
- Title not available (Why is that?)
- Fast generation of cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notes on D-optimal designs
- Numbers of cubic graphs
- Title not available (Why is that?)
- Some Improvements in Weighing and Other Experimental Techniques
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- On Hotelling's Weighing Problem
- \(D\)-optimal weighing designs for six objects.
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- D-optimal Designs for Seven Objects and a Large Number of Weighings
Cited In (5)
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- D-optimal \((0,1)\)-weighing designs for eight objects
- D-optimal (0,1)-weighing designs for 10 objects
- Graph-theoretic techniques in D-optimal design problems
- The trace-minimal graph with \(2v\) vertices and regularity \(v+1\)
This page was built for publication: Trace-minimal graphs and D-optimal weighing designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576216)
