首页 | 本学科首页   官方微博 | 高级检索  
     检索      

顺序和顺序哈密顿有向图
引用本文:王牟江山,原军,林上为.顺序和顺序哈密顿有向图[J].数学季刊,2010,25(3).
作者姓名:王牟江山  原军  林上为
作者单位:School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China 
基金项目:Supported by the National Natural Science Foundation of China(61070229); Supported by the Natural Science Foundation of Shanxi Province(2008011010)
摘    要:A digraph D is k-ordered if for every sequence S:v 1,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.

关 键 词:有向图  哈密顿  顺序  

Ordered and Ordered Hamilton Digraphs
WANG Shi-ying,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).
Authors:WANG Shi-ying  WANGMU Jiang-shan  YUAN Jun  LIN Shang-wei  WANG Shi-ying
Institution:WANGMU Jiang-shan 1,YUAN Jun 2,LIN Shang-wei 2,WANG Shi-ying 2 (1.School of Mathematical Sciences,Sichuan University,Chengdu 610064,China,2.School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)
Abstract:
Keywords:digraphs  k-ordered digraphs  k-ordered hamiltonian digraphs  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号