Asymptotic behaviour of the number of Eulerian circuits (Q648413)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5976497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic behaviour of the number of Eulerian circuits |
scientific article; zbMATH DE number 5976497 |
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
0.8779847621917725
0 references
0.8310360312461853
0 references
0.8080731630325317
0 references
0.7793781161308289
0 references
