Counting rooted spanning forests in cobordism of two circulant graphs

DOI10.33048/SEMI.2020.17.059MaRDI QIDQ779138zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1185220 (Why is no real title available?)
• scientific article; zbMATH DE number 1188564 (Why is no real title available?)
• scientific article; zbMATH DE number 1862742 (Why is no real title available?)
• scientific article; zbMATH DE number 2107985 (Why is no real title available?)
• A survey of the theory of hypercube graphs
• Asymptotics and arithmetical properties of complexity for circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Counting spanning trees in cobordism of two circulant graphs
• Counting spanning trees in prism and anti-prism graphs
• Enumeration of Forests in a Graph
• Enumeration of I-graphs: Burnside does it again
• Heights of polynomials and entropy in algebraic dynamics
• I-graphs and the corresponding configurations
• Isomorphism checking of \(I\)-graphs
• On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials
• On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
• On the Number of Distinct Forests
• Spanning tree formulas and Chebyshev polynomials
• Spanning trees on graphs and lattices inddimensions
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• The number of spanning trees in odd valent circulant graphs

Cited in

(6)

• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
• Counting spanning trees in cobordism of two circulant graphs
• The generating function is rational for the number of rooted forests in a circulant graph
• Counting rooted spanning forests for circulant foliation over a graph
• The number of rooted forests in circulant graphs
• Möbius coinvariants and bipartite edge-rooted forests

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)