Honeycomb toroidal graphs are Cayley graphs
暂无分享,去创建一个
[1] Xiaofan Yang,et al. Honeycomb tori are Hamiltonian , 1999, Inf. Process. Lett..
[2] Xiaofan Yang,et al. Fault-Tolerant Ring Embedding in a Honeycomb Torus with Node Failures , 1999, Parallel Process. Lett..
[3] H. Coxeter,et al. Generators and relations for discrete groups , 1957 .
[4] Ivan Stojmenovic,et al. Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..
[5] H. Wielandt,et al. Finite Permutation Groups , 1964 .
[6] Behrooz Parhami,et al. A Unified Formulation of Honeycomb and Diamond Networks , 2001, IEEE Trans. Parallel Distributed Syst..
[7] Wenjun Xiao,et al. Hexagonal and Pruned Torus Networks as Cayley Graphs , 2004, Communications in Computing.
[8] G. Sabidussi. On a class of fixed-point-free graphs , 1958 .
[9] Wenjun Xiao,et al. Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes , 2007, Discret. Appl. Math..
[10] Amos Altshuler,et al. Hamiltonian circuits in some maps on the torus , 1972, Discret. Math..
[11] Hong-Jian Lai,et al. Generalized honeycomb torus is Hamiltonian , 2004, Inf. Process. Lett..
[12] D. Maru,et al. Symmetries of Hexagonal Molecular Graphs on the Torus , 2000 .
[13] Li-Yen Hsu,et al. Generalized honeycomb torus , 2003, Inf. Process. Lett..
[14] Li-Yen Hsu,et al. Ring embedding in faulty honeycomb rectangular torus , 2002, Inf. Process. Lett..
[15] C. C. Chen,et al. On a class of Hamiltonian laceable 3-regular graphs , 1996, Discret. Math..