Asymptotic Behaviour of the Number of Eulerian Circuits

Mikhail Isaev

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.


Full Text: PDF