Infinite Circulant Digraphs and Random Infinite Circulant Digraphs |
| |
| Authors: | Qiang Xiang Huang Ji Xiang Meng Fu Ji Zhang |
| |
| Affiliation: | (1) The College of Mathematics and Sciences, Xinjiang University, Urumqi 830046, P. R. China E-mail: huangqx@xju.edu.cn, CN;(2) The Department of Mathematics, Xiamen University, Xiamen 361005, P. R. China E-mail: fjzhang@jingxian.xmu.edu.cn, CN |
| |
| Abstract: | In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one- and two-way infinite Hamiltonian paths. Received February 4, 1998, Accepted May 16, 2002 |
| |
| Keywords: | Infinite circulant digraph Connectivity Hamiltonian path |
| 本文献已被 SpringerLink 等数据库收录！ |
|
