Asymptotic behavior of the number of Eulerian orientations of graphs

DOI10.1134/S0001434613050210zbMATH Open1269.05072arXiv1110.2598OpenAlexW1982715928MaRDI QIDQ358192FDOQ358192

M. I. Isaev

Publication date: 16 August 2013

Published in: Mathematical Notes (Search for Journal in Brave)

Abstract: We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In addition, we establish some new properties of the Laplacian matrix, as well as an estimate of a conditionality of matrices with the asymptotic diagonal predominance

Full work available at URL: https://arxiv.org/abs/1110.2598

Recommendations

• On the number of Eulerian orientations of a graph
• scientific article; zbMATH DE number 742958
• Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties
• Publication:4351083
• An upper bound for the number of Eulerian orientations of a regular graph
• Counting the Eulerian orientations of one class of circulant graphs
• Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
• Asymptotics of the Euler number of bipartite graphs
• Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs

zbMATH Keywords

Laplacian matrixspanning treealgebraic connectivitysimple graphconditioning of a matrixEulerian orientation of a graphmatrix with diagonal dominance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• On the number of Eulerian orientations of a graph
• Title not available (Why is that?)
• Le Polynôme De Martin D'un Graphe Eulerien
• An upper bound for the number of Eulerian orientations of a regular graph
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• Asymptotic behaviour of the number of Eulerian circuits
• Bounds on the number of Eulerian orientations
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs

Cited In (3)

• Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
• Universality and asymptotics of graph counting problems in non-orientable surfaces
• Title not available (Why is that?)

This page was built for publication: Asymptotic behavior of the number of Eulerian orientations of graphs

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