Hamilton paths in Cayley diagraphs of metacyclic groups
نویسنده
چکیده
Curran, S.J., Hamilton paths in Cayley digraphs of metacyclic groups, Discrete Mathematics 115 (1993) 133-139. We obtain a characterization of all Hamilton paths in the Cayley digraph of a metacyclic group G with generating set {x, y} where (yx-‘) a G. The abundance of these Hamilton paths allows us to show that Hamilton paths occur in groups of at least two.
منابع مشابه
Hamilton paths in Cayley graphs on generalized dihedral groups
We investigate the existence of Hamilton paths in connected Cayley graphs on generalized dihedral groups. In particular, we show that a connected Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamiltonconnected, unless it is bipartite, in which case it is Hamilton-laceable.
متن کامل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...
متن کاملLocally Primitive Normal Cayley Graphs of Metacyclic Groups
A complete characterization of locally primitive normal Cayley graphs of metacyclic groups is given. Namely, let Γ = Cay(G,S) be such a graph, where G ∼= Zm.Zn is a metacyclic group and m = p1 1 p r2 2 · · · p rt t such that p1 < p2 < · · · < pt. It is proved that G ∼= D2m is a dihedral group, and val(Γ ) = p is a prime such that p|(p1(p1 − 1), p2 − 1, . . . , pt − 1). Moreover, three types of ...
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملComparing a Cayley Digraph with Its Reverse
A Cayley digraph G = C(Γ, X) for a group Γ and a generating set X is the digraph with vertex set V (G) = Γ and arcs (g, gx) where g ∈ Γ and x ∈ X. The reverse of C(Γ, X) is the Cayley digraph G−1 = C(Γ, X−1) where X−1 = {x−1;x ∈ X}. We are interested in sufficient conditions for a Cayley digraph not to be isomorphic to its reverse and focus on Cayley digraphs of metacyclic groups with small gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 115 شماره
صفحات -
تاریخ انتشار 1993