Mathematics – Combinatorics
Scientific paper
2011-04-15
The Electronic Journal of Combinatorics 18, 1 (2011) 219
Mathematics
Combinatorics
Scientific paper
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.
No associations
LandOfFree
Asymptotic behaviour of the number of the Eulerian circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Asymptotic behaviour of the number of the Eulerian circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic behaviour of the number of the Eulerian circuits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8907