Geodesic
Asymptotic behaviour of the number of Eulerian circuits
The electronic journal of combinatorics, Tome 18 (2011) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv
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.
DOI : 10.37236/706
Classification : 05C50, 05C45
Mots-clés : undirected simple graphs with large algebraic connectivity, Laplacian matrix 
Mikhail Isaev. Asymptotic behaviour of the number of Eulerian circuits. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/706
@article{10_37236_706,
     author = {Mikhail Isaev},
     title = {Asymptotic behaviour of the number of {Eulerian} circuits},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/706},
     zbl = {1229.05202},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/706/}
}
TY  - JOUR
AU  - Mikhail Isaev
TI  - Asymptotic behaviour of the number of Eulerian circuits
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/706/
DO  - 10.37236/706
ID  - 10_37236_706
ER  - 
%0 Journal Article
%A Mikhail Isaev
%T Asymptotic behaviour of the number of Eulerian circuits
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/706/
%R 10.37236/706
%F 10_37236_706

Cité par Sources :