Graph complexity and the laplacian matrix in blocked experiments

DOI10.1080/03081089008818029zbMath0714.05040MaRDI QIDQ3199446

Gregory M. Constantine

Publication date: 1990

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089008818029

zbMATH Keywords

efficiency; Laplacian matrix; maximal complexity

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Laplace eigenvalues of graphs---a survey, Laplacian matrices of graphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• A-Optimal Incomplete Block Designs for Control-Test Treatment Comparisons
• Schur convex functions on the spectra of graphs
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Some sufficient conditions for the type 1 optimality of block designs
• On the optimality of block designs
• On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment
• A bound for the complexity of a simple graph
• Schur complements and statistics
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• On the E-optimality of PBIB designs with a small number of blocks
• Optimality of certain asymmetrical experimental designs
• Manifestations of the Schur complement
• Circuits and efficiency in incomplete block designs