In this paper, first, we show that if D D is a 2-regular strongly connected digraph with two orbits then λ(D)=2 λ ( D ) = 2 , if D D is a k k -regular strongly ...

Let X=(V,E) be a connected regular graph. X is said to be super-edge-connected if every minimum edge cut of X is a set of edges incident with some vertex. The ...

Let D = (V,A) be a simple strongly connected digraph and let Aut(D) be an automor- phism of V (D). For x ∈ V (D), the set {xg : g ∈ Aut(D)} is called an ...

Xing Chen , Dongyang Xie, Yongsheng Jiang, Nannan Fan: The Arc-Connectivity of 3-Regular Digraphs with Two Orbits. J. Interconnect.

The set {xg:g∈Aut(G)} is called an orbit of Aut(G). In this paper, we determine the edge connectivity of 3-regular and 4-regular connected graphs with two ...

Mar 15, 2024 · For example, in [8], Chen et al. studied the arc-connectivity of 3-regular digraphs with two orbits. In [18], Gu and Chang studied the super ...

Missing: Arc- Digraphs

So, let us consider the arc u −→Gi x, the existence of which is guaranteed by the fact that Gi is connected and each arc is self-paired since Gi is a ...

Apr 15, 2022 · A connected graph \Gamma=(V,E) of valency at least 3 is called a basic 2-arc-transitive graph if its full automorphism group has a subgroup G with the ...

A number of constructions are given for arc-transitive digraphs, based on modifications of permutation representations of finite groups.