In this paper we investigate the foliowing generalization of transitivity: A digraph D is (m, n)-transitive whenever there is a path of length m from x to y there is a subset of n + 1 vertices of these m + 1 vertices which contain a path of length n from x to y. Here we study various properties of
β¦ LIBER β¦
Testing Transitivity in Digraphs
β Scribed by Martin Karlberg
- Book ID
- 108506038
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 122 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0081-1750
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On a generalization of transitivity for
β
Andras GyΓ‘rfΓ‘s; Michael S. Jacobson; Lael F. Kinch
π
Article
π
1988
π
Elsevier Science
π
English
β 758 KB
Testing transitivity in choice under ris
β
Michael H. Birnbaum; Ulrich Schmidt
π
Article
π
2009
π
Springer US
π
English
β 217 KB
Distance transitive digraphs
β
Clement W.H. Lam
π
Article
π
1980
π
Elsevier Science
π
English
β 980 KB
A digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v) = d(x, y) there is an automorphism w of the digraph such that T(U) = x and T(V) = y. Some examples of distance-transitive digraphs are given in Section 2. Section 3 defines the intersection matrix and gives
-kernels in -transitive and -quasi-trans
β
CΓ©sar HernΓ‘ndez-Cruz; Hortensia Galeana-SΓ‘nchez
π
Article
π
2012
π
Elsevier Science
π
English
β 248 KB
Kings in quasi-transitive digraphs
β
Jβ
rgen Bang-Jensen; Jing Huang
π
Article
π
1998
π
Elsevier Science
π
English
β 505 KB
A conjecture on -transitive digraphs
β
Ruixia Wang
π
Article
π
2012
π
Elsevier Science
π
English
β 206 KB