Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties

zbMATH Open1324.05091MaRDI QIDQ5264718FDOQ5264718

Authors: M. I. Isaev, K. V. Isaeva 

Publication date: 27 July 2015

Full work available at URL: http://mathnet.ru/eng/da752

Recommendations

• Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
• Publication:4351083
• Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
• Asymptotic behavior of the number of Eulerian orientations of graphs
• scientific article; zbMATH DE number 91021

zbMATH Keywords

asymptotic analysisLaplacianalgebraic connectivityEulerian orientationGaussian integral

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited In (5)

• Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
• Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
• Enumeration of Golomb rulers and acyclic orientations of mixed graphs
• Title not available (Why is that?)
• Asymptotic behavior of the number of Eulerian orientations of graphs

This page was built for publication: Asymptotic enumeration of Eulerian orientations for graphs with strong mixing properties

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