Research indexBook chapter
Digraphs
Wallis
Birkhäuser Boston eBooks1 Jan 2000
NobleIDark:/48914/w1/20260524/F1E7FB05DOI10.1007/978-1-4757-3134-7_10
Digraphs
Wallis · Birkhäuser Boston eBooks · 2000 · Subscription
NobleIDark:/48914/w1/20260524/F1E7FB05DOI10.1007/978-1-4757-3134-7_10
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Recall from Chapter 1 that a digraph is a finite set v of objects called vertices together with a finite set of directed edges, or arcs which are ordered pairs of vertices. It is like a graph except that each edge is allocated a direction — one vertex is designated a start and the other is a finish. An arc directed from start s to finish t is denoted (s, t) or simply s.t It is important to observe that, unlike a graph, a digraph can have two arcs with the same endpoints, provided they are directed in opposite ways. But we shall not allow multiple arcs or loops.