Asymptotic behaviour of the number of Eulerian circuits (Q648413): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1104.3046 / rank | |||
Normal rank | |||
Latest revision as of 15:42, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic behaviour of the number of Eulerian circuits |
scientific article |
Statements
Asymptotic behaviour of the number of Eulerian circuits (English)
0 references
22 November 2011
0 references
Summary: 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.
0 references
undirected simple graphs with large algebraic connectivity
0 references
Laplacian matrix
0 references
