顺序和顺序哈密顿有向图

数学季刊 ›› 2010, Vol. 25 ›› Issue (3): 317-326.

• • 下一篇

顺序和顺序哈密顿有向图

1. School of Mathematical Sciences, Sichuan University2. School of Mathematical Sciences, Shanxi University

收稿日期:2008-07-31 出版日期:2010-09-30 发布日期:2023-05-23
作者简介: 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 the National Natural Science Foundation of China(61070229)； Supported by the Natural Science Foundation of Shanxi Province(2008011010)；

Ordered and Ordered Hamilton Digraphs

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)；

摘要/Abstract

摘要： A digraph D is k-ordered if for every sequence S : v₁, v_2,· · · , v_k 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 : v_1, v_2,· · · , v_k 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.

关键词: digraphs, k-ordered digraphs, k-ordered hamiltonian digraphs

Abstract: A digraph D is k-ordered if for every sequence S : v₁, v_2,· · · , v_k 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 : v_1, v_2,· · · , v_k 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

中图分类号:

O157.5

王牟江山, 原军, 林上为等. 顺序和顺序哈密顿有向图[J]. 数学季刊, 2010, 25(3): 317-326.

WANGMU Jiang-shan, YUAN Jun, LIN Shang-wei, WANG Shi-ying. Ordered and Ordered Hamilton Digraphs[J]. Chinese Quarterly Journal of Mathematics, 2010, 25(3): 317-326.

顺序和顺序哈密顿有向图

Ordered and Ordered Hamilton Digraphs

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics

本文评价