Name
Abstract | ||
|---|---|---|
A strongly connected digraph D is said to be maximally arc connected if its arc-connectivity lambda(D) attains its minimum degree delta(D). For any vertex x of D, the set {x(g)vertical bar g is an element of Aut(D)} is called an orbit of Aut(D). Liu and Meng [Fengxia Liu, Jixiang Meng, Edge-Connectivity of regular graphs with two orbits, Discrete Math. 308 (2008) 3711-3717 1 proved that the edge-connectivity of a k-regular connected graph with two orbits and girth >= 5 attains its regular degree k. In the present paper, we prove the existence of k-regular m-arc-connected digraphs with two orbits for some given integer k and m. Furthermore, we prove that the k-regular connected digraphs with two orbits, satisfying girth >= k are maximally arc connected. Finally, we give an example to show that the girth bound k is best possible. |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS COMBINATORIA | Arc-connectivity,Orbit |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Arc (geometry),Mathematics | Journal | 125 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qian Xie | 1 | 0 | 0.34 |
| Xing Chen | 2 | 37 | 4.46 |
| Jixiang Meng | 3 | 353 | 55.62 |