go-v.orgdoi

Asymptotic Behaviour of the Number of Eulerian Circuits

Mikhail Isaev · The Electronic Journal of Combinatorics · 2011

  • DOI 10.37236/706
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2011

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2011

Abstract

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.

Open the resolved locator · 10.37236/706

Metadata licence: OpenAlex metadata (CC0)