A new technique for the characterization of graphs with a maximum number of spanning trees (Q1349105)

From MaRDI portal
Revision as of 04:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new technique for the characterization of graphs with a maximum number of spanning trees
scientific article

    Statements

    title
    A new technique for the characterization of graphs with a maximum number of spanning trees (English)
    0 references
    author
    O. Diekmann
    0 references
    publication date
    21 May 2002
    0 references
    Mathematics Subject Classification ID
    05C75
    0 references
    05C05
    0 references
    05C50
    0 references
    05C30
    0 references
    zbMATH DE Number
    1743035
    0 references
    zbMATH Keywords
    spanning trees
    0 references
    \(t\)-optimal graphs
    0 references
    characterizations
    0 references
    degree sequence
    0 references
    multipartite graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1349105&oldid=26170237"
    Powered by MediaWiki