Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T19:08:54.247Z Has data issue: false hasContentIssue false

Minimally strong digraphs

Published online by Cambridge University Press:  20 January 2009

Dennis P. Geller
Affiliation:
Logic of Computers Group, University of Michigan, Ann Arbor, Michigan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Dirac (2) and Plummer (5) independently investigated the structure of minimally 2-connected graphs G, which are characterized by the property that for any line x of G, G–x is not 2-connected. In this paper we investigate an analogous class of strongly connected digraphs D such that for any arc x, D–x is not strong. Not surprisingly, these digraphs have much in common with the minimally 2-connected graphs, and a number of theorems similar to those in (2) and (5) are proved, notably our Theorems 9 and 12.

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1970