Asymptotic behaviour of the number of the Eulerian circuits
Combinatorics
2012-01-31 v3
Abstract
We determine the asymptotic behaviour of the number of the 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.
Keywords
Cite
@article{arxiv.1104.3046,
title = {Asymptotic behaviour of the number of the Eulerian circuits},
author = {Mikhail Isaev},
journal= {arXiv preprint arXiv:1104.3046},
year = {2012}
}