Skip to main content
SpringerLink
Log in

Randomlyn-cyclic digraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A digraphD is randomlyn-cyclic (n≥3) if for each vertexv ofD, every (directed) path with initial vertexv and having length at mostn−1 can be extended to av−v (directed) cycle of lengthn. Several results related to and examples of randomlyn-cyclic digraphs are presented. Also, all randomlyn-cyclic digraphs forn=3, 4, and 5 are determined.

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

Similar content being viewed by others

References

  1. Behzad, M., Chartrand, G., Lesniak-Foster, L.: Graphs & Digraphs. Belmont: Wadsworth International 1979

    MATH  Google Scholar 

  2. Chartrand, G., Kronk, H.V., Lick, D.R.: Randomly Hamiltonian digraphs. Fund. Math.45, 223–226 (1969).

    MathSciNet  Google Scholar 

  3. Dirac, G.A., Thomassen, C.: Graphs in which every finite path is contained in a circuit. Math. Ann203, 65–75 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  4. Harary, F.: Graph Theory, Reading: Addison-Wesley 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Western Michigan University, 49008, Kalamazoo, MI, USA

    Gary Chartrand & Ortrud R. Oellermann

  2. Instituto de Mathematicas, Universidad Católica de Valparaiso, Valparaíso, Chile

    Sergio Ruiz

Authors
  1. Gary Chartrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ortrud R. Oellermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergio Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by a Western Michigan University faculty research fellowship.

Research supported in part by a College of Arts and Sciences and Graduate College research assistantship from Western Michigan University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chartrand, G., Oellermann, O.R. & Ruiz, S. Randomlyn-cyclic digraphs. Graphs and Combinatorics 1, 29–40 (1985). https://doi.org/10.1007/BF02582926

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02582926

Keywords

Search

Navigation