Skip to main content
SpringerLink
Log in

Digraphs

  • Chapter
  • First Online:
Basic Graph Theory

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 6075 Accesses

Abstract

A graph is usually called a directed graph or a digraph if its edges have directions. The concept of directed graphs has many applications in solving real-world problems. In this chapter we study some properties of digraphs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Meyniel, M.: Une condition sufficiante d’exittance d’un circuit Hamiltonian dans un graph oriente. J. Comb. Theory Ser. B 14, 137–147 (1073)

    Article  Google Scholar 

  2. Redei, L.: Ein Kombinatorischer Satz. Acta Litterania Szeged 7, 39–43 (1934)

    Google Scholar 

  3. Ford, L.R., Fulkerson, D.R.: Maximum flow through a network. Can. J. Math. 8, 399–404 (1956)

    Article  MATH  Google Scholar 

  4. Goodrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis, and Internet Examples. Wiley, New York (2002)

    MATH  Google Scholar 

  5. Jon Kleinberg, M., Tardos, E.: Algorithm Design. Addison-Wesley, Boston (2006)

    Google Scholar 

  6. Clark, J., Holton, D.A.: A First Look at Graph Theory. World Scientific, Singapore (1991)

    Google Scholar 

  7. Wilson, R.J.: Introduction to Graph Theory, 4th edn. Longman, London (1996)

    Google Scholar 

  8. Pirzada, S.: An Introduction to Graph Theory. University Press, India (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh

    Md. Saidur Rahman

Authors
  1. Md. Saidur Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Md. Saidur Rahman .

Exercises

Exercises

  1. 1.

    Construct a complete digraph of five vertices. Construct three different orientations of \(K_5\).

  2. 2.

    Find a directed path of the longest possible length in the digraph in Fig. 8.7.

  3. 3.

    Find all strongly connected components in the digraph in Fig. 8.7.

  4. 4.

    Prove that a connected acyclic digraph always has a source and a sink.

  5. 5.

    Let T be any tournament. Prove that the converse of T and the complement of T are isomorphic.

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Rahman, M.S. (2017). Digraphs. In: Basic Graph Theory. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-49475-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49475-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49474-6

  • Online ISBN: 978-3-319-49475-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation