Graph complexity and the laplacian matrix in blocked experiments (Q3199446): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4176810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanent of the Laplacian matrix of trees and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of certain asymmetrical experimental designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the E-optimality of PBIB designs with a small number of blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schur convex functions on the spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manifestations of the Schur complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A-Optimal Incomplete Block Designs for Control-Test Treatment Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the determination and construction of MV-optimal block designs for comparing test treatments with a standard treatment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for the type 1 optimality of block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the complexity of a simple graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schur complements and statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits and efficiency in incomplete block designs / rank
 
Normal rank

Latest revision as of 11:35, 21 June 2024

scientific article
Language Label Description Also known as
English
Graph complexity and the laplacian matrix in blocked experiments
scientific article

    Statements

    Graph complexity and the laplacian matrix in blocked experiments (English)
    0 references
    1990
    0 references
    efficiency
    0 references
    Laplacian matrix
    0 references
    maximal complexity
    0 references

    Identifiers