Accession Number : AD0714815

Title :   Characterizations and Constructions of Minimally 2-Connected Graphs and Minimally Strong Digraphs.

Descriptive Note : Technical rept.,

Corporate Author : IOWA UNIV IOWA CITY DEPT OF MATHEMATICS

Personal Author(s) : Hedetniemi,Stephen

Report Date : NOV 1970

Pagination or Media Count : 34

Abstract : The report presents one short inductive proof which characterizes, by construction, both the minimally 2-connected graphs and the minimally strong digraphs. Several operations are given which can be used to construct minimally strong digraphs from other minimally strong digraphs and then, by straightforward modifications, these operations are shown to construct minimally 2-connected graphs from other minimally 2-connected graphs. (Author)

Descriptors :   (*GRAPHICS, THEORY), AUTOMATA, THEOREMS

Subject Categories : Numerical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE