Name
Abstract | ||
|---|---|---|
Let X=(V, E) be a digraph. X is maximally connected, if \kappa(X)=\delta(X). X is maximally arc-connected, if \lambda(X)=\delta(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that the strongly connected Bi-Cayley digraphs are maximally connected and maximally arc-connected, and the most of strongly connected Bi-Cayley digraphs are super arc-connected. |
Year | Venue | Field |
|---|---|---|
2016 | Ars Comb. | Discrete mathematics,Combinatorics,Arc (geometry),Vertex (geometry),Cayley digraphs,Strongly connected component,Mathematics,Digraph,Lambda |
DocType | Volume | Citations |
Journal | 124 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| yuhu liu | 1 | 0 | 0.34 |
| Jixiang Meng | 2 | 353 | 55.62 |