CONNECTIVITY IN DIGRAPHS.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1969
Accession Number
AD0691140

Entities

People

  • Dennis P. Geller

Organizations

  • University of Michigan

Tags

DTIC Thesaurus Topics

  • Hierarchies

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.