Completely strong path-connected tournaments
暂无分享,去创建一个
Abstract Let T = ( V , A ) be a tournament with p vertices. T is called completely strong path-connected if for each arc ( a , b ) ∈ A and k ( k = 2, 3,…, p ), there is a path from b to a of length k (denoted by P k ( a , b )) and a path from a to b of length k (denoted by P ′ k ( a , b )). In this paper, we prove that T is completely strong path-connected if and only if for each arc ( a , b ) ∈ A , there exist P 2 ( a , b ), P ′ 2 ( a , b ) in T , and T satisfies one of the following conditions: (a) T / T 0 -type graph, (b) T is 2-connected, (c) for each arc ( a , b ) ∈ A , there exists a P ′ p −1 ( a , b ) in T .
[1] F Ian. ON THE STRONG PATH CONNECTIVITY OF A TOURNAMENT , 1979 .
[2] Brian Alspach,et al. Bypasses in asymmetric digraphs , 1974 .
[3] Richard H. Schelp,et al. The square of a block is strongly path connected , 1976 .
[4] Carsten Thomassen,et al. Hamiltonian-connected tournaments , 1980, J. Comb. Theory, Ser. B.