On the characterization of graphs with maximum number of spanning trees (Q1377718)

From MaRDI portal
Revision as of 03:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the characterization of graphs with maximum number of spanning trees
scientific article

    Statements

    On the characterization of graphs with maximum number of spanning trees (English)
    0 references
    14 September 1998
    0 references
    A number of results are proved with respect to so-called \(t\)-optimal graphs, i.e. graphs which have the maximum number of spanning trees among all graphs with the same number of nodes and edges.
    0 references
    spanning trees
    0 references
    0 references
    0 references
    0 references

    Identifiers