On the exponent set of primitive locally semicomplete digraphs
Tóm tắt
A locally semicomplete digraph is a digraph D = (V,A) satisfying the following condition: for every vertex x ∈ V the D[O(x)] and D[I(x)] are semicomplete digraphs. In this paper, we get some properties of cycles and determine the exponent set of primitive locally semicomplete digraphs.
Tài liệu tham khảo
Bang Jensen, J., Locally semicomplete digraph; A gneralization of tournaments. J. Graph Theory, 14:3(1990), 371–390.
Bang Jensen, J., On the structure of locally semicomplete digraphs, Dis. Math., 100(1992), 243–265.
Berman, A. and Plemraons. R. J., Nonnegative Matrices in the Mathematical Science, Academic Press, New York, 1979.
Bu Yuehua and Zhang Kemin, Arc-pancyclicity of local tournaments. Ars Combinatorica, (1997) (to appear).
Bu Yuehua and Zhang Kemin, Completely strong path-connectivity of local tournaments, Ars Combinatorica, (1998) (to appear).
Moon. J. W. and Pullman, N. J., On the power of tournament matrices, J. Combin. Theory, 3(1967), 1–9.
Roberts, J. B., Notes on linear forms, Proc. Arner. Math. Soc., 7(1975), 456–469.
Shao Jiayu, On the exponent of primitive digraph, LAA, 64(1985), 21–31.