23 citations · 74 across the 23 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012★ 1 cited
Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
Mikhail Isaev
We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up…
math.CO2012
On the class of graphs with strong mixing properties
Mikhail Isaev, K. V Isaeva
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenv…