Counting rooted spanning forests in cobordism of two circulant graphs
DOI10.33048/semi.2020.17.059zbMath1444.05066OpenAlexW3113399969MaRDI QIDQ779138
Gal'ya Amanboldynovna Baĭgonakova, Ilya A. Mednykh, Nikolaĭ Vladimirovich Abrosimov, Liliya Aleksandrovna Grunwald
Publication date: 21 July 2020
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2020.17.059
Mahler measureChebyshev polynomialPetersen graphcirculant graphprism graphspanning forest\(I\)-graph
Enumeration in graph theory (05C30) Additive difference equations (39A10) Structural characterization of families of graphs (05C75)
Related Items (2)
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
- Counting spanning trees in cobordism of two 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
- On the Number of Distinct Forests
- Enumeration of I-graphs: Burnside does it again
- Enumeration of Forests in a Graph
- 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 rooted spanning forests in cobordism of two circulant graphs
