Hamilton Cycles in Trivalent Cayley Graphs
نویسندگان
چکیده
It is shown that the Trivalent Cayley graphs, TC,,, are near recursive. In particular, TC, is a union of four copies of i”Cn_2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC,.
منابع مشابه
Heuristic search for Hamilton cycles in cubic graphs
A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS
متن کاملGraphs of Permutation Groups
1. Dejter, I., Giudici, R.E.: On Unitary Cayley graphs, JCMCC, 18,121-124. 2. Brrizbitia, P and Giudici, R.E. 1996, Counting pure k-cycles in sequence of Cayley graphs, Discrete math., 149, 11-18. 3. Madhavi, L and Maheswari, B.2009, Enumeration of Triangles and Hamilton Cycles in Quadratic residue Cayley graphas, Chamchuri Journal of Mathematics, 1,95-103. 4. Madhavi, L and Maheswari, B. 2010,...
متن کاملHamilton cycles and paths in vertex-transitive graphs - Current directions
In this article current directions in solving Lovász’s problem about the existence of Hamilton cycles and paths in connected vertex-transitive graphs are given. © 2009 Elsevier B.V. All rights reserved. 1. Historical motivation In 1969, Lovász [59] asked whether every finite connected vertex-transitive graph has a Hamilton path, that is, a simple path going through all vertices, thus tying toge...
متن کاملOn Unitary Cayley Graphs
AssrRAcr. We deal with a family of undirected Cayley graphs X. which are unions of disjoint Hamilton cycles, and some of their properties, where rz runs over the positive integers. It is proved that X-is a bipartite graph when n is even. If n is an odd number, we count the number of different colored triangles in Xn.
متن کاملVertex-transitive Haar graphs that are not Cayley graphs
In a recent paper (arXiv:1505.01475 ) Estélyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex-transitive but non-Cayley. The smallest example has 40 vertices and is the well-known Kronecker cover over the dodecahedron graph G(10, 2), occurring as the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 60 شماره
صفحات -
تاریخ انتشار 1996