#### Filter Results:

#### Publication Year

2010

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mikhail Isaev
- 2010

- Mikhail Isaev
- 2010

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.

- Mikhail Isaev, K. V Isaeva
- 2012

We study three mixing properties of a graph: large algebraic connec-tivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk on the graph. We prove equivalence of this properties (in some sense). We give estimates for the probability for a… (More)

- ‹
- 1
- ›