Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Asymptotic Number of Eulerian Oriented Graphs with Multiple Edges

Xiaoji Wang 1
1School of Mathematics, University of New South Wales, PO Boz 1, Kensington, NSW 2033, Australia
  • Published: 30/06/1997

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(\log n)\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Xiaoji Wang . The Asymptotic Number of Eulerian Oriented Graphs with Multiple Edges[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 024. 243-249. DOI: .