Maximally-Connected Vert ex-Transitive Bipartite Digraph
The connectivity κ(X)of a digraph X is the minimum cardinality of vertices the deletion of which makes the remaining digraph no longer strongly connected.If the connectivity of a digraph X is equal to the minimum degree,then X is said to be maximally vertex-connected.It is proved that a strongly connected vertex-transitive bipartite digraph is maximally vertex-connected,and the Bi-Cayley digraph is also maximally vertex-connected.
万方数据
维普
