Vertex transitivity and super line connectedness
SIAM Journal on Discrete Mathematics
On super-edge-connected digraphs and bipartite digraphs
Journal of Graph Theory
Subsets with small sums in Abelian groups' I: the Vosper property
European Journal of Combinatorics
Extraconnectivity of s-geodetic and graphs
Discrete Mathematics
On restricted edge-connectivity of graphs
Discrete Mathematics
Connectivity of vertex and edge transitive graphs
Discrete Applied Mathematics
Graph Theory With Applications
Graph Theory With Applications
Note: Super-connected edge transitive graphs
Discrete Applied Mathematics
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
The existence and upper bound for two types of restricted connectivity
Discrete Applied Mathematics
Double-super-connected digraphs
Discrete Applied Mathematics
Note: Small cutsets in arc-transitive digraphs of prime degree
Discrete Applied Mathematics
| Hi-index | 0.04 |
A digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set or in-neighbor set of a vertex. A digraph is said to be reducible, if there are two vertices with the same out-neighbor set or the same in-neighbor set. In this paper, we prove that a strongly connected arc-transitive oriented graph is either reducible or super-connected. Furthermore, if this digraph is also an Abelian Cayley digraph, then it is super-connected.