Skip to main content
Article thumbnail
Location of Repository

Asymptotic behaviour of the number of the Eulerian circuits

By Mikhail Isaev

Abstract

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

Topics: Mathematics - Combinatorics
Year: 2012
OAI identifier: oai:arXiv.org:1104.3046
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.3046 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.