Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of certain asymmetrical experimental designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations of a graph increasing its Laplacian polynomial and number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3288481 / rank
 
Normal rank

Revision as of 13:31, 13 June 2024

scientific article
Language Label Description Also known as
English
Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
scientific article

    Statements

    Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (English)
    0 references
    0 references
    1981
    0 references
    D-optimum design
    0 references
    multipartite graph
    0 references
    spanning trees
    0 references

    Identifiers