CONNECTIVITY IN DIGRAPHS.
MICHIGAN UNIV ANN ARBOR LOGIC OF COMPUTERS GROUP
Pagination or Media Count:
The theory of connectivity is extended from graphs to digraphs by introducing connectivity measures similar to the well-known point- and line-connectivities for graphs. Some simple upper and lower bounds are discussed for these parameters, and classes of digraphs are presented with various prescribed connectivities. The many equivalent formulations of 2-connectedness for graphs are examined and the hierarchies of connectedness that their digraphical analogs suggest are discussed. Author
- Theoretical Mathematics