Counting spanning trees in cobordism of two circulant graphs
From MaRDI portal
Publication:1615746
zbMath1398.05058MaRDI QIDQ1615746
Nikolaĭ Vladimirovich Abrosimov, Gal'ya Amanboldynovna Baĭgonakova, Ilya A. Mednykh
Publication date: 31 October 2018
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Trees (05C05) Graph polynomials (05C31) Enumeration in graph theory (05C30) Additive difference equations (39A10) Structural characterization of families of graphs (05C75)
Related Items (5)
On the Jacobian group of a cone over a circulant graph ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Complexity of the circulant foliation over a graph ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ Complexity of discrete Seifert foliations over a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- Asymptotics and arithmetical properties of complexity for circulant graphs
- A survey of the theory of hypercube graphs
- Spanning tree formulas and Chebyshev polynomials
- Heights of polynomials and entropy in algebraic dynamics
- The number of spanning trees in circulant graphs
- The number of spanning trees in odd valent circulant graphs
- Isomorphism checking of \(I\)-graphs
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- Enumeration of I-graphs: Burnside does it again
- Spanning trees on graphs and lattices inddimensions
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- I-graphs and the corresponding configurations
This page was built for publication: Counting spanning trees in cobordism of two circulant graphs
