Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
From MaRDI portal
Publication:5056827
DOI10.26493/1855-3974.2530.e7czbMath1504.05141arXiv1812.04484OpenAlexW2905558881MaRDI QIDQ5056827
Ilya A. Mednykh, Alexander Mednykh
Publication date: 8 December 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04484
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotics and arithmetical properties of complexity for circulant graphs
- Smith normal form and Laplacians
- The asymptotic number of spanning trees in circulant graphs
- Spanning tree formulas and Chebyshev polynomials
- The number of spanning trees of a complete multipartite graph
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- The number of spanning trees in circulant graphs
- The number of spanning trees in odd valent circulant graphs
- Factorization of certain cyclotomic functions
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- The formulas for the number of spanning trees in circulant 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
- The Mahler measure of algebraic numbers: a survey
- On Some Inequalities for Polynomials in Several Variables
- A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI
- Spanning trees on graphs and lattices inddimensions
- On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
- The number of spanning trees in a prism
- Spanning tree generating functions and Mahler measures
- On the structure of the critical group of a circulant graph with non-constant jumps
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- On the number of spanning trees of finite graphs
- Asymptotic Enumeration of Spanning Trees
This page was built for publication: Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics