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

From MaRDI portal
Revision as of 09:31, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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