Graph complexity and the laplacian matrix in blocked experiments
From MaRDI portal
Publication:3199446
DOI10.1080/03081089008818029zbMATH Open0714.05040OpenAlexW2043719240MaRDI QIDQ3199446FDOQ3199446
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
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- A-Optimal Incomplete Block Designs for Control-Test Treatment Comparisons
- Schur complements and statistics
- Title not available (Why is that?)
- Manifestations of the Schur complement
- Optimality of certain asymmetrical experimental designs
- Schur convex functions on the spectra of graphs
- A bound for the complexity of a simple graph
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- On the optimality of block designs
- Permanent of the Laplacian matrix of trees and bipartite graphs
- On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment
- Circuits and efficiency in incomplete block designs
- Some sufficient conditions for the type 1 optimality of block designs
- On the E-optimality of PBIB designs with a small number of blocks
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
- Title not available (Why is that?)
- Laplace eigenvalues of graphs---a survey
- Combinatorics of optimal designs
- Consistency matters: revisiting the structural complexity for supply chain networks
- Construction of efficient experimental designs under multiple resource constraints
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- On the likelihood of forests
- 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)
