For a finitely generated group G = 〈A〉, where A = {a1, a2, . . . , an}, the sequence xi = ai, 1 ≤ i ≤ n, xi+n = ∏n j=1 xi+j−1, i ≥ 1, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). In this paper we examine the Fibonacci leng...

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 groups. 2000 Mathematics Subject Classification: 05C25, 20B25.

Abstract: In this paper, we compute number of fuzzy subgroups of some dihedral groups such as D2pn where p is a prime number and D2p1×p2×···×pn where p1, p2, ..., pn are distinct prime numbers. We use their chain diagram to determine the number of their fuzzy subgroups and present an explicit recursive formula to D2pn and at the result in specially case D2n and finally a formula to count number...

We consider the kernel of the natural projection from the Artin group of dihedral type I2(k) to the associated Coxeter group, which we call a pure Artin group of dihedral type and write PI2(k). We show that the growth rates for both the spherical growth series and geodesic growth series of PI2(k) with respect to a natural generating set are Pisot numbers. 2010 Mathematics Subject Classification...

The adjacency spectrum of a graph Γ , which is denoted by Spec(Γ ), is the multiset of eigenvalues of its adjacency matrix. We say that two graphs Γ and Γ ′ are cospectral if Spec(Γ ) = Spec(Γ ). In this paper for each prime number p, p ≥ 23, we construct a large family of cospectral non-isomorphic Cayley graphs over the dihedral group of order 2p. © 2016 Elsevier B.V. All rights reserved.

The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case for even dihedral groups). The matrix weight function for the Gaussian form is found explicitly by solving a boundary value problem, and then computing the n...

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

Let k be an algebraically closed field of characteristic 2. We calculate the vertices of all indecomposable kD8-modules for the dihedral group D8 of order 8. We also give a conjectural formula of the induced module of a string module from kT0 to kG where G is a dihedral group G of order ≥ 8 and where T0 is a dihedral subgroup of index 2 of G. Some cases where we verified this formula are given.

In this paper we prove that given a generalized dihedral group DH and a generating subset S, if S∩H 6= ∅ then the Cayley digraph → Cay(DH , S) is Hamiltonian. The proof we provide is via a recursive algorithm that produces a Hamilton circuit in the digraph.

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.