Asymptotic behaviour of the number of Eulerian circuits (Q648413)

From MaRDI portal
Revision as of 15:50, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Asymptotic behaviour of the number of Eulerian circuits
scientific article

    Statements

    Asymptotic behaviour of the number of Eulerian circuits (English)
    0 references
    0 references
    22 November 2011
    0 references
    Summary: 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.
    0 references
    undirected simple graphs with large algebraic connectivity
    0 references
    Laplacian matrix
    0 references

    Identifiers