Counting rooted spanning forests in cobordism of two circulant graphs

DOI10.33048/SEMI.2020.17.059zbMATH Open1444.05066OpenAlexW3113399969MaRDI QIDQ779138FDOQ779138

Authors: Nikolaĭ Vladimirovich Abrosimov, Gal'ya Amanboldynovna Baĭgonakova, Liliya Aleksandrovna Grunwald, I. A. Mednykh 

Publication date: 21 July 2020

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2020.17.059

Recommendations

• Counting spanning trees in cobordism of two circulant graphs
• Counting rooted spanning forests for circulant foliation over a graph
• The number of rooted forests in circulant graphs
• The numbers of spanning trees of some families of circulant graphs
• The numbers of spanning trees in undirected circulant graphs

zbMATH Keywords

Chebyshev polynomialPetersen graphcirculant graphMahler measureprism graphspanning forest\(I\)-graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Additive difference equations (39A10)

Cites Work

• Title not available (Why is that?)
• Heights of polynomials and entropy in algebraic dynamics
• Title not available (Why is that?)
• A survey of the theory of hypercube graphs
• Spanning tree formulas and Chebyshev polynomials
• Spanning trees on graphs and lattices inddimensions
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Title not available (Why is that?)
• The number of spanning trees in odd valent circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Isomorphism checking of \(I\)-graphs
• Enumeration of I-graphs: Burnside does it again
• I-graphs and the corresponding configurations
• Title not available (Why is that?)
• Counting spanning trees in cobordism of two circulant graphs
• Asymptotics and arithmetical properties of complexity for circulant graphs
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• On the Number of Distinct Forests
• Enumeration of Forests in a Graph
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials

Cited In (3)

• Möbius coinvariants and bipartite edge-rooted forests
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• Counting rooted spanning forests for circulant foliation over a graph

This page was built for publication: Counting rooted spanning forests in cobordism of two circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779138)