Asymptotic behaviour of the number of Eulerian circuits

MaRDI QIDQ648413zbMATH OpenFDO

Authors M. I. Isaev

Publication date 22 November 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.3046, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p219.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Laplacian matrixundirected simple graphs with large algebraic connectivity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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.

Review text

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.

Recommendations

• Asymptotic behavior of the number of Eulerian orientations of graphs
• Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• scientific article; zbMATH DE number 91021

Cited in

(5)

• Asymptotic behavior of the number of Eulerian orientations of graphs
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• Asymptotic enumeration of difference matrices over cyclic groups
• Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
• Asymptotics of the Euler number of bipartite graphs

This page was built for publication: Asymptotic behaviour of the number of Eulerian circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648413)