Graph complexity and the laplacian matrix in blocked experiments

DOI10.1080/03081089008818029MaRDI QIDQ3199446zbMATH OpenOpenAlexFDO

Authors 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

efficiencyLaplacian matrixmaximal complexity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

Recommendations

• Graph connection Laplacian and random matrices with random blocks
• A graph complexity measure based on the spectral analysis of the Laplace operator
• The exponential distance matrix of block graphs
• scientific article; zbMATH DE number 3891428
• On the block number of graphs
• The computational complexity of optimal blocking of vertices in the digraph
• On the adjacency matrix of a block graph
• Block transitivity and degree matrices
• scientific article; zbMATH DE number 7626706
• Empirical distributions of Laplacian matrices of large dilute random graphs

Cites work

• scientific article; zbMATH DE number 3612277 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• A bound for the complexity of a simple graph
• A-Optimal Incomplete Block Designs for Control-Test Treatment Comparisons
• Circuits and efficiency in incomplete block designs
• Manifestations of the Schur complement
• 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
• On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment
• On the optimality of block designs
• Optimality of certain asymmetrical experimental designs
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Schur complements and statistics
• Schur convex functions on the spectra of graphs
• Some sufficient conditions for the type 1 optimality of block designs

Cited in

(11)

• Entropy and the complexity of graphs revisited
• Laplacian matrices of graphs: A survey
• Graph connection Laplacian and random matrices with random blocks
• scientific article; zbMATH DE number 7626706 (Why is no real title available?)
• Laplace eigenvalues of graphs---a survey
• Combinatorics of optimal designs
• Consistency matters: revisiting the structural complexity for supply chain networks
• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• On the likelihood of forests
• Construction of efficient experimental designs under multiple resource constraints
• A calculus for measuring the elegance of abstract graphs

This page was built for publication: Graph complexity and the laplacian matrix in blocked experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199446)