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-...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.展开更多
基金Supported by Natural Science Foundation of China (Project 10171085).
文摘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.
