Graphs, networks, and linear unbiased estimates

DOI10.1016/S0166-218X(02)00592-9zbMath1020.05010OpenAlexW1967695903MaRDI QIDQ1408450

Gregory M. Constantine

Publication date: 22 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00592-9

zbMATH Keywords

subspaceestimationpathspanning treecyclomatic number

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Statistical block designs (62K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A-Optimal Incomplete Block Designs for Control-Test Treatment Comparisons
• On the optimality of block designs
• On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• On a general class of graph polynomials
• Optimality of certain asymmetrical experimental designs
• Block designs and electrical networks
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Graphs, networks, and linear unbiased estimates