Further analysis of the number of spanning trees in circulant graphs (Q860448): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xue-rong Yong / rank
Normal rank
 
Property / author
 
Property / author: Xue-rong Yong / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.05.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121225779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fibonacci numbers via trigonometric expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in odd valent circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / 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: Q3844474 / 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 12:06, 25 June 2024

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

    Statements

    Further analysis of the number of spanning trees in circulant graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    Let \(T(C_n^{s_1,s_2,\dots,s_k})=na_n^2\) denote the number of spanning trees of the graph \(C_n^{s_1,s_2,\dots,s_k}\). The authors investigate the numbers \(a_n\) further and, in particular, give asymptotic results on these quantities.
    0 references
    0 references
    spanning tree numbers
    0 references
    circulant graphs
    0 references
    0 references