Chinese Quarterly Journal of Mathematics ›› 2010, Vol. 25 ›› Issue (3): 317-326.

    Next Articles

Ordered and Ordered Hamilton Digraphs

  

  1. 1. School of Mathematical Sciences, Sichuan University2. School of Mathematical Sciences, Shanxi University
  • Received:2008-07-31 Online:2010-09-30 Published:2023-05-23
  • About author: WANGMU Jiang-shan(1988- ), male, native of Urumqi, Xinjiang, a student of Sichuan University, engages in graph theory with application; YUAN Jun(1979- ), male, native of Changzhi, Shanxi, Ph.D., an associate professor of Taiyuan University of Science and Technology, doctoral adviser, engages in graph theory with application.
  • Supported by:
     Supported by the National Natural Science Foundation of China(61070229)； Supported by the Natural Science Foundation of Shanxi Province(2008011010)；

PDF (PC)

33

Abstract: A digraph D is k-ordered if for every sequence S : v1, v2, · · · , vk of k distinct vertices, there exists a cycle C such that C encounters the vertices of S in the specified order. In particular, we say that D is k-ordered hamiltonian if for every sequence S : v1, v2, · · · , vk of k distinct vertices, there exists a hamiltonian cycle C such that the vertices of S are encountered on C in the specified order. In this paper, sufficient conditions for digraphs to be ordered and ordered hamiltonian have been given.

Key words: digraphs, k-ordered digraphs, k-ordered hamiltonian digraphs

CLC Number: 

Copyright © Chinese Quarterly Journal of Mathematics, All Rights Reserved.
Tel: 0371-23881698　E-mail: sxjk@henu.edu.cn　QQ: 2454327236
Powered by Beijing Magtech Co., Ltd.