On the number of spanning trees in directed circulant graphs (Q2719844): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Line-Connectivity Properties of Circulant Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behavior of the maximum number of spanning trees in circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting trees in directed regular multigraphs / rank
 
Normal rank

Revision as of 16:41, 3 June 2024

scientific article
Language Label Description Also known as
English
On the number of spanning trees in directed circulant graphs
scientific article

    Statements

    On the number of spanning trees in directed circulant graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2001
    0 references
    network reliability
    0 references
    spanning trees
    0 references
    directed circulant graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references