Super-connected arc-transitive digraphs
Super-connected arc-transitive digraphs
复制标题
DOI：
10.1016/j.dam.2008.08.018
复制
发表时间：
2009-02
期刊：
影响因子：
--
通讯作者：
J. Meng;Zhao Zhang
中科院分区：
文献类型：
--
作者：
J. Meng;Zhao Zhang
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.
