Contents

-

The Asymptotic Number of Eulerian Oriented Graphs with Multiple Edges

Xiaoji Wang1
1School of Mathematics, University of New South Wales, PO Boz 1, Kensington, NSW 2033, Australia

Abstract

We estimate the number of labelled loop-free Eulerian oriented graphs with multiple edges with n vertices by using an n-dimensional Cauchy integral. An asymptotic formula is obtained for the case where the multiplicity of each edge is O(logn).