ویراساینس.
سند علمی

The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups

Xiangwen Li, Vicky H. Mak-Hau, Sanming Zhou

چکیده

A k-L(2, 1)-labelling of a graph G is a mapping f : V (G) → {0, 1, 2, . . . , k} such that |f(u)− f(v)| ≥ 2 if uv ∈ E(G) and f(u) 6= f(v) if u, v are distance two apart. The smallest positive integer k such that G admits a k-L(2, 1)-labelling is called the λ-number of G. In this paper we study this quantity for cubic Cayley graphs (other than the prism graphs) on dihedral groups, which are called brick product graphs or honeycomb toroidal graphs. We prove that the λ-number of such a graph is between 5 and 7, and moreover we give a characterisation of such graphs with λ-number 5.

اسناد مشابه

  • The Normality of Cubic Cayley Graphs for Dihedral Groups

    سند علمی۲۰۰۱Mehdi Alaeiyan, G. R. Safakish

    A Cayley graph Γ = Cay(G, S) is called normal for G, if GR, the right regular representation of G, is a normal subgroup of the full automorphism group Aut(Γ ) of Γ . In this paper we determine the normality of connected and undirected Cayley graphs of valency three for dihedral g

  • Hamiltonicity of cubic Cayley graphs

    سند علمی۲۰۰۵Henry Glover, Dragan Marušič

    Following a problem posed by Lovász in 1969, it is believed that every finite connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from finite groups having a (2, s, 3)-presentation, that is, for groups G = 〈a, b | a

  • 5-Arc transitive cubic Cayley graphs on finite simple groups

    سند علمی۲۰۰۷Eur. J. Comb.Shang Jin Xu, Xin Gui Fang, Jie Wang, Ming Yao Xu

    In this paper, we determine all connected 5-arc transitive cubic Cayley graphs on the alternating group A47; there are only two such graphs (up to isomorphism). By earlier work of the authors, these are the only two nonnormal connected cubic arc-transitive Cayley graphs for finit

  • The isomorphism problem for Cayley graphs

    سند علمی۲۰۰۷Mikhail Muzychuk

    The isomorphism problem for Cayley graphs over a group H will be considered and solved completely for cyclic groups H of prime power order for every prime p including p = 2. The method we use to obtain our solution is based on Schur rings. This method can be applied as well to co

  • Hamiltonian cycles in cubic Cayley graphs: the 〈2,4k,3〉 case

    سند علمی۲۰۰۹Henry H. Glover, Klavdija Kutnar, Dragan Marušič

    It was proved by Glover and Marušič (J. Eur. Math. Soc. 9:775–787, 2007), that cubic Cayley graphs arising from groups G = 〈a, x | a2 = x = (ax)3 = 1, . . .〉 having a (2, s,3)-presentation, that is, from groups generated by an involution a and an element x of order s such that th

  • Cubic Cayley graphs with small diameter

    سند علمی۲۰۰۱Discrete Mathematics & Theoretical Computer ScienceEugene Curtin

    In this paper we apply Pólya’s Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group. We report the results of a search of all three-regular Cayley graphs on permutation groups of degree at most ni