Counting spanning trees in cobordism of two circulant graphs (Q1615746): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: I-graphs and the corresponding configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / 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: A survey of the theory of hypercube graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism checking of \(I\)-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: Q4791752 / 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: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of I-graphs: Burnside does it again / 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: COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS / 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: Chebyshev polynomials and spanning tree formulas for circulant and related 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 03:45, 17 July 2024

scientific article
Language Label Description Also known as
English
Counting spanning trees in cobordism of two circulant graphs
scientific article

    Statements

    Counting spanning trees in cobordism of two circulant graphs (English)
    0 references
    31 October 2018
    0 references
    circulant graph
    0 references
    \(I\)-graph
    0 references
    Petersen graph
    0 references
    spanning tree
    0 references
    Chebyshev polynomial
    0 references
    Mahler measure
    0 references

    Identifiers

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