Minimally strong digraphs
- 1 June 1970
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 17 (1) , 15-22
- https://doi.org/10.1017/s0013091500009147
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A Theorem on Graphs, with an Application to a Problem of Traffic ControlThe American Mathematical Monthly, 1939