The number of spanning trees in odd valent circulant graphs (Q1827730): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114190813, #quickstatements; #temporary_batch_1711055989931
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: Q3996998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Trees in a Certain Class of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in circulant graphs / rank
 
Normal rank

Latest revision as of 18:25, 6 June 2024

scientific article
Language Label Description Also known as
English
The number of spanning trees in odd valent circulant graphs
scientific article

    Statements

    The number of spanning trees in odd valent circulant graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Spanning tree
    0 references
    Circulant graph
    0 references
    Linear recurrence relation
    0 references
    Asymptotic behavior
    0 references

    Identifiers