On depth first search strees inm-out digraphs

Abstract

We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let π i be thei th vertex encountered by DFS andL(i, m, n) be the height of π i in the corresponding DFS tree. We show that ifi/n→α asn→∞, then there exists a constanta(α,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(α,m) asn→∞. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    Ajtai, M., Komlós, J., andSzemerédi, E.: The longest path in a random graph,Combinatorica 1 (1981), 1–12.

    Google Scholar 

  2. [2]

    Bollobás, B. Random Graphs, Academic Press, (1985).

  3. [3]

    Fenner, T. I., andFrieze, A. M. On large matchings and cycles in sparse random graphs,Discrete Mathematics 59, (1986), 243–256.

    Google Scholar 

  4. [4]

    Fernandez de la Vega, W. Long paths in random graphs,Studia Sci. Math. Hung. 14 (1979), 335–340.

    Google Scholar 

  5. [5]

    Gibbons, A. Algorithmic Graph Theory, Cambridge University Press, (1985).

  6. [6]

    Goursat, E. A Course in Mathematical Analysis, Vol. 1 Dover Publ., New York, (1959).

    Google Scholar 

  7. [7]

    Suen, S. PhD dissertation, University of Bristol, UK, (1985).

  8. [8]

    Suen, S. On the largest strong components inm-out digraphs,Discrete Math 94 (1991), 45–52.

    Google Scholar 

  9. [9]

    Suen, S. On large induced tree and long induced cycles in sparse random graphs,J. Combinat. Th. Ser. B. 56 (1992), 250–262.

    Google Scholar 

  10. [10]

    Tarjan, R. Depth first and linear graph algorithms,SIAM. J. Comput 1 (1972), 146–160.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Stephen Suen, W.C. On depth first search strees inm-out digraphs. Combinatorica 13, 209–229 (1993). https://doi.org/10.1007/BF01303205

Download citation

AMS subject classification code (1991)

  • 05 C 20
  • 68 R 10