^{1}

^{1}

^{*}

^{1}

Tian and Meng in [Y. Tian and J. Meng, *λ*_{c} -Optimally half vertex transitive graphs with regularity *k*, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity *k* and girth *g*(*G*) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree *δ*(*G*) ≥ 6 and girth *g*(*G*) ≥ 6.

The traditional connectivity and edge-connectivity, are important measures for networks, which can correctly reflect the fault tolerance of systems with few processors, but it always underestimates the resilience of large networks. The discrepancy incurred is because events whose occurrence would disrupt a large network after a few processors, therefore, the disruption envisaged occurs in a worst case scenario. To overcome such a shortcoming, Latifi et al. [

Throughout the paper graphs are undirected finite connected without loops or multiple edges.

Let be a graph, an edge set is a cyclic edge-cut if is disconnected and at least two of its components contain cycles. Clearly, a graph has a cyclic edge-cut if and only if it has two vertexdisjoint cycles. A graph is said to be cyclically separable if has a cyclic edge-cut. Note that Lovász [

The cyclic edge-connectivity plays an important role in some classic fields of graph theory such as Hamiltonian graphs (Máčajová and Šoviera [

For two vertex sets is the set of edges with one end in and the other end in. For any vertex set, is the subgraph of induced by, is the complement of. Clearly, if is a minimum cyclic edge-cut, then both

and are connected. We set

where is the number of edges with one end in and the other end in. It has been proved in Wang and Zhang [

Cyclic edge-fragment and cyclic edge-atom play a fundamental role. A vertex set is a cyclic edgefragment, in short, fragment, if is a minimum cyclic edge-cut. A cyclic edge-fragment with the minimum cardinality is called a cyclic edge-atom, in short, atom. A cyclic edge-fragment of is said to be super, if neither nor induces a shortest cycle, in short, super fragment. A super cyclic edge-fragment with the minimum cardinality is called a super cyclic edge-atom, in short, super atom. A cyclic edge-fragment is said to be trivial, if it induces a cycle, otherwise it is nontrivial.

A graph is said to be vertex transitive if acts transitively on, and is edge transitive if acts transitively on. A bipartite graph is biregular, if all the vertices from the same partite set have the same degree. We abbreviate the bipartite graph as a -biregular graph, if the two distinct degrees are and respectively. A bipartite graph with bipartition is called half vertex transitive [

an orbit of. Clearly, acts transitively on each orbit of. Transitive graphs have been playing an important role in designing network topologies, since they possess many desirable properties such as high fault tolerance, small transitive delay, etc. [13,14].

In Nedela and Škoviera [

Theorem 1.1 ([

Motivated by the work in Tian and Meng [

Lemma 2.1 ([

Lemma 2.2 ([

An imprimitive block of is a proper nonempty subset of such that for any automorphism, either or.

Lemma 2.3 ([

If X is a super atom, and is a proper subset of X such that is a cyclic edge-cut and is not a shortest cyclic, then

The observation is used frequently in the proofs.

Lemma 2.4 ([

(1);

(2) If, then holds for any;

(3) If is not a cycle and is a vertex in X with, then holds for any;

(4) If, and X is a non-trivial atom of Gthen. Furthermore, holds for any. and holds for any.

Lemma 2.5 ([

Lemma 2.6 ([

Lemma 2.7 Let G be a connected (p,q)-half vertex transitive graph with bipartition, and girth. Suppose A is a atom of G and. If G is not -optimal, then

(1) is a disjoint union of distinct atoms;

(2) Y is a -half vertex transitive graph, where.

Proof. Let

andthen

.

Since A is a -atom, we have

.

(1) Since and Aut(X) acts transitively both on and, each vertex of G lies in a - atom. by Lemma 2.3, we have that is a disjoint union of distinct -atoms.

(2) Let, then there exits an automorphism

of G with and so. By Lemma 2.3,. Thus the restriction of on A induces an automorphism of Y, and then Aut(Y) acts transitively on. Similarly, Aut(Y) acts transitively on. and are two orbits of Aut(G). By (1), there exists, such that

Since Aut(G) has two orbits and, for any and, and

. Thus, we have, , and. Thus Y is a

-half vertex transitive graph, where

(by Lemma 2.4).

Lemma 2.8 ([

Lemma 2.9 Let G be a connected (p,q)-half vertex transitive graph with bipartition and girth. Suppose A is a super atom of G and. If G is -optimal but not super-, then

(1) is a disjoint union of distinct super atoms;

(2) Y is a -half vertex transitive graph, where

With a similar argument as the proof of Lemma 2.7, we can prove it.

Theorem 3.1 Let G be a connected (p,q)-half vertex transitive graph with bipartition, and girth, then G is -optimal.

Proof. By Lemma 2.1, G is cyclically separable. Suppose G is not -optimal. By Lemma 2.2, every atom is impimitive block. Let A be a atom of G, by Lemma 2.3, is half-vertex transitive. Let

and, then.

Suppose is by Lemma 2.4 (2),

. Let C be a shortest cycle of. Then by Lemma 2.4 (2) and Lemma 2.5, contains two disjoint cycles, and is s cyclic edgecut. Clearly, since no two vertices of C have common neighbor in. Then,

a contradiction.

Theorem 3.2 Let G be a connected -half vertex transitive graph with bipartition, and girth, then G is super-.

Proof. By Theorem 3.1, G is -optimal. Suppose G is not super-. By Lemma 2.8, G has a super atom. By Lemma 2.9, every super atom is impimitive block. Let A be a super atom of G, by Lemma 2.3, is halfvertex transitive. Let andthen. Suppose is by Lemma 2.4 (2),. Let C be a shortest cycle of. With a similar proof as Theorem 3.1, we can get

, a contradiction.

We would like to appreciate the anonymous referees for the valuable suggestions which help us a lot in refining the presentation of this paper.