The trace-minimal graph with \(2v\) vertices and regularity \(v+1\)

DOI10.1016/j.disc.2007.08.097zbMath1160.05035OpenAlexW1989980422MaRDI QIDQ941365

Takumi Saegusa

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.097

zbMATH Keywords

unit cuberegular graphnumber of trianglesd-optimal weighing designsmaximum volume simplexstatistical designstrace-minimal graph

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
• Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
• Trace-minimal graphs and D-optimal weighing designs
• D-optimal weighing designs for four and five objects
• D-optimal Designs for Seven Objects and a Large Number of Weighings
• \(D\)-optimal weighing designs for six objects.

This page was built for publication: The trace-minimal graph with \(2v\) vertices and regularity \(v+1\)