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.
| Original language | English |
|---|---|
| Article number | P219 |
| Number of pages | 35 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 18 |
| Issue number | 1 |
| Publication status | Published - 2011 |
| Externally published | Yes |