On vosperian and superconnected vertex-transitive digraphs
classification
🧮 math.CO
keywords
areaautomorphismcardinalityconsistscutsetdigraphdigraphsevery
read the original abstract
We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.