Asymptotic behavior of the number of Eulerian orientations of graphs

DOI10.1134/S0001434613050210zbMath1269.05072arXiv1110.2598OpenAlexW1982715928MaRDI QIDQ358192

Mikhail Isaev

Publication date: 16 August 2013

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

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

zbMATH Keywords

spanning treeLaplacian matrixsimple graphalgebraic connectivityconditioning of a matrixEulerian orientation of a graphmatrix with diagonal dominance

Mathematics Subject Classification ID

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

Related Items (1)

Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An upper bound for the number of Eulerian orientations of a regular graph
• On the number of Eulerian orientations of a graph
• Le Polynôme De Martin D'un Graphe Eulerien
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph

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