Abstract
In recent years diverse literatures have been published on circulants (cf. [2] and the references cited therein). In this paper we consider the infinite analogues of circulant and random infinite circulant, and their connectivities and hamiltonian properties are discussed. Especially we answer a question of [4] in the case of infinite (undirected) circulants, and some results on random infinite circulants are also obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Harary. Graph Theory. Addison-Wesley, 1969.
F. Boech and R. Tindell. Circulants and Their Connectivity.J. Graph Theory, 1984, 8: 487–499.
R Tindell. The Connectivity of a Graph and Its Complement,Ann. Discrete Math., 1982, 13: 191–202.
D. Witte and J.A. Gallian. A Survey: Hamiltonian Cycles in Cayley Graphs.Discrete Mathematics, 1984, 51: 293–304.
I.L. Jungreis. Infinite Hamiltonian Paths in Cayley Digraphs.Discrete Mathematics, 1985, 54: 167–180.
C.D. Godsil. Connectivity of Minimal Cayley Graphs.Arch. Math., 1981, 37: 473–476.
Loeve. M. Probability Theory (second edition). D. Van Nostrand Company, INC, 1960.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, F., Huang, Q. Infinite circulants and their properties. Acta Mathematicae Applicatae Sinica 11, 280–284 (1995). https://doi.org/10.1007/BF02011193
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02011193