Complexity of the circulant foliation over a graph (Q2025146): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Counting spanning trees in cobordism of two circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted spanning trees on some self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Remarkable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on the Sierpinski gasket / 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: Q3838155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heights of polynomials and entropy in algebraic dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of spanning trees in circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree generating functions and Mahler measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Y-graphs and H-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smith normal form and Laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics and arithmetical properties of complexity for circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials. Translated from the second Russian edition by Dimitry Leites. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on graphs and lattices in<i>d</i>dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism classes of the generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev polynomials and spanning tree formulas for circulant and related graphs / rank
 
Normal rank

Revision as of 18:06, 25 July 2024

scientific article
Language Label Description Also known as
English
Complexity of the circulant foliation over a graph
scientific article

    Statements

    Complexity of the circulant foliation over a graph (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    spanning trees
    0 references
    circulant graphs
    0 references
    Petersen graphs
    0 references
    \(I\)-graphs
    0 references
    Laplacian matrices
    0 references
    Chebyshev polynomials
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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