The number of spanning trees of a complete multipartite graph (Q1292859): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of Point Labelled Chromatic Graphs and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for Cayley trees, spanning trees, and their q-analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of extended graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)90111-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4229577196 / rank
 
Normal rank

Latest revision as of 09:42, 30 July 2024

scientific article
Language Label Description Also known as
English
The number of spanning trees of a complete multipartite graph
scientific article

    Statements

    The number of spanning trees of a complete multipartite graph (English)
    0 references
    0 references
    27 February 2000
    0 references
    complete multipartite graph
    0 references
    bijection
    0 references
    asymptotic probability
    0 references
    expected degree
    0 references

    Identifiers