Super-connected arc-transitive digraphs

作者：Meng Jixiang; Zhang Zhao^*

来源：Discrete Applied Mathematics, 2009, 157(4): 653-658.

DOI：10.1016/j.dam.2008.08.018

• Super-connected
• Hyper-connected
• Vosperian
• Bi-super-connected
• Arc-transitive
• Oriented graph

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.

• 出版日期2009-2-28
• 单位新疆大学