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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import recommendations run Q6767936
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2003.12.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020042726 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114190813 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2003.12.006 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: The number of spanning trees in circulant graphs / rank
 
Normal rank
Property / Recommended article: The number of spanning trees in circulant graphs / qualifier
 
Similarity Score: 0.94818234
Amount0.94818234
Unit1
Property / Recommended article: The number of spanning trees in circulant graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the number of spanning trees of circulant graphs / rank
 
Normal rank
Property / Recommended article: On the number of spanning trees of circulant graphs / qualifier
 
Similarity Score: 0.94533825
Amount0.94533825
Unit1
Property / Recommended article: On the number of spanning trees of circulant graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2743116 / rank
 
Normal rank
Property / Recommended article: Q2743116 / qualifier
 
Similarity Score: 0.94104344
Amount0.94104344
Unit1
Property / Recommended article: Q2743116 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2743083 / rank
 
Normal rank
Property / Recommended article: Q2743083 / qualifier
 
Similarity Score: 0.9360749
Amount0.9360749
Unit1
Property / Recommended article: Q2743083 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2829791 / rank
 
Normal rank
Property / Recommended article: Q2829791 / qualifier
 
Similarity Score: 0.9315377
Amount0.9315377
Unit1
Property / Recommended article: Q2829791 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic / rank
 
Normal rank
Property / Recommended article: The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic / qualifier
 
Similarity Score: 0.92758816
Amount0.92758816
Unit1
Property / Recommended article: The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic / qualifier
 
Property / Recommended article
 
Property / Recommended article: The asymptotic number of spanning trees in circulant graphs / rank
 
Normal rank
Property / Recommended article: The asymptotic number of spanning trees in circulant graphs / qualifier
 
Similarity Score: 0.92687273
Amount0.92687273
Unit1
Property / Recommended article: The asymptotic number of spanning trees in circulant graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: The formulas for the number of spanning trees in circulant graphs / rank
 
Normal rank
Property / Recommended article: The formulas for the number of spanning trees in circulant graphs / qualifier
 
Similarity Score: 0.9230802
Amount0.9230802
Unit1
Property / Recommended article: The formulas for the number of spanning trees in circulant graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5489994 / rank
 
Normal rank
Property / Recommended article: Q5489994 / qualifier
 
Similarity Score: 0.9226867
Amount0.9226867
Unit1
Property / Recommended article: Q5489994 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Further analysis of the number of spanning trees in circulant graphs / rank
 
Normal rank
Property / Recommended article: Further analysis of the number of spanning trees in circulant graphs / qualifier
 
Similarity Score: 0.9219118
Amount0.9219118
Unit1
Property / Recommended article: Further analysis of the number of spanning trees in circulant graphs / qualifier
 

Latest revision as of 19:37, 4 April 2025

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