Skip to main content
SpringerLink
Log in

Asymptotic Enumeration of Extensional Acyclic Digraphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The enumeration of extensional acyclic digraphs, which have the property that the outneighbourhoods are pairwise distinct, was considered in a recent article of Policriti and Tomescu. Several asymptotic questions were left as open problems. In this article, we determine the asymptotic number of such digraphs and show that a number of distributional results can be carried over from ordinary acyclic digraphs. In particular, we consider the distribution of the number of sources, the number of arcs, the maximum rank and the number of vertices of maximum rank, thereby also proving some conjectures made by Policriti and Tomescu. Finally, we study a very similar class of acyclic digraphs and provide analogous distributional results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. The On-Line Encyclopedia of Integer Sequences: (2012). Published electronically at http://oeis.org

  2. Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat. 25(2), 505–541 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bender, E.A., Richmond, L.B., Robinson, R.W., Wormald, N.C.: The asymptotic number of acyclic digraphs. I. Combinatorica 6(1), 15–22 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bender, E.A., Robinson, R.W.: The asymptotic number of acyclic digraphs. II. J. Comb. Theory, Ser. B 44(3), 363–369 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  5. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  6. Gessel, I.M.: Counting acyclic digraphs by sources and sinks. Discrete Math. 160(1–3), 253–258 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Grabner, P.J., Steinsky, B.: Asymptotic behaviour of the poles of a special generating function for acyclic digraphs. Aequ. Math. 70(3), 268–278 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Harary, F., Palmer, E.M.: Graphical Enumeration. Academic Press, New York (1973)

    MATH  Google Scholar 

  9. Liskovets, V.A.: The number of maximal vertices of a random acyclic digraph. Teor. Verojatnost. Primenen. 20(2), 412–421 (1975)

    Google Scholar 

  10. McKay, B.D.: On the shape of a random acyclic digraph. Math. Proc. Camb. Philos. Soc. 106(3), 459–465 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Peddicord, R.: The number of full sets with n elements. Proc. Am. Math. Soc. 13, 825–828 (1962)

    MathSciNet  MATH  Google Scholar 

  12. Policriti, A., Tomescu, A.I.: Counting extensional acyclic digraphs. Inf. Process. Lett. 111(16), 787–791 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Robinson, R.W.: Counting labeled acyclic digraphs. In: New Directions in the Theory of Graphs. Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, MI, 1971, pp. 239–273. Academic Press, New York (1973)

    Google Scholar 

  14. Steinsky, B.: Enumeration of labelled chain graphs and labelled essential directed acyclic graphs. Discrete Math. 270(1–3), 267–278 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Steinsky, B.: Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs. Graphs Comb. 20(3), 399–411 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wagner, S.: Asymptotic enumeration of extensional acyclic digraphs. In: Proceedings of the ANALCO12 Meeting on Analytic Algorithmics and Combinatorics, Kyoto, January 16, 2012 pp. 1–8 (2012)

    Google Scholar 

Download references

Acknowledgements

I would like to thank Alexandru Tomescu for telling me about this interesting problem.

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Stellenbosch University, Private Bag X1, Matieland, 7602, South Africa

    Stephan Wagner

Authors
  1. Stephan Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stephan Wagner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wagner, S. Asymptotic Enumeration of Extensional Acyclic Digraphs. Algorithmica 66, 829–847 (2013). https://doi.org/10.1007/s00453-012-9725-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-012-9725-4

Keywords

Search

Navigation