Asymptotic Behaviour of the Number of Eulerian Circuits

  • Mikhail Isaev
DOI: https://doi.org/10.37236/706

Abstract

We determine the asymptotic behaviour of the number of Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). We also prove some new properties of the Laplacian matrix.

Published
2011-11-14
How to Cite
Isaev, M. (2011). Asymptotic Behaviour of the Number of Eulerian Circuits. The Electronic Journal of Combinatorics, 18(1), P219. https://doi.org/10.37236/706
Issue
Volume 18, Issue 1 (2011)
Article Number
P219