Abstract
Let V be a finite nonempty set and let V 2 be its Cartesian square. A directed graph, or digraph is a pair (V, A), where A⊆ V 2. The elements of V are called the vertices of the digraph, and the elements of A are called its arcs. The sets of vertices and arcs of a digraph G are denoted by VG and AG respectively. The number |VG| is called the order of the digraph G and is also denoted by |G|. If |G| = n and |AG| = m then G is said to be an (n, m)-digraph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Melnikov, O., Sarvanov, V., Tyshkevich, R., Yemelichev, V., Zverovich, I. (1998). Directed Graphs. In: Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1514-0_11
Download citation
DOI: https://doi.org/10.1007/978-94-017-1514-0_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4979-7
Online ISBN: 978-94-017-1514-0
eBook Packages: Springer Book Archive