Available online at J. Math. Comput. Sci. 2 (2012), No. 6, ISSN: COSET CAYLEY DIGRAPH STRUCTURES
|
|
- Beverly Marshall
- 5 years ago
- Views:
Transcription
1 Available online at J. Math. Comput. Sci. 2 (2012), No. 6, ISSN: COSET CAYLEY DIGRAPH STRUCTURES ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, 1 Department of Mathematics, University of Calicut, Malappuram, Kerala, India Mannaniya College of Arts & Science, Pangode, Trivandrum, Kerala, India Abstract. In this paper, we generalize the results in [9] to produce a new classes of Cayley digraph structures induced by groups. Keywords: Cayley digraph, Digraph structure, Cayley digraph structure AMS Subject Classification: 05C25 1. Introduction A binary relation on a set V is a subset E of V V. A digraph is a pair (V, E) where V is a non empty set (called vertex set) and E is a binary relation on V. The elements of E are called edges. Let V be a non empty set and let E 1, E 2,..., E n be mutually disjoint binary relations on V. Then the (n + 1)-tuple G = (V ; E 1, E 2,..., E n ) is called a digraph structure[9]. The elements of V are called vertices and the elements of E i are called E i -edges. The following definition were introduced in [9]. A digraph structure (V ; E 1, E 2,..., E n ) is called (i)e 1 E 2 E n -trivial if E i = for all i, and E i - trivial if E i = (ii)e 1 E 2 E n - reflexive if for all x G, (x, x) E i for some i, and E i - reflexive if for all x V, (x, x) E i (iii) E 1 E 2 E n - symmetric if E i = E 1 i all i, and E i - symmetric if E i = E 1 i (iv) E 1 E 2 E n - anti symmetric, if (x, y) E i and Corresponding author for Received July 13,
2 COSET CAYLEY DIGRAPH STRUCTURES 1767 (y, x) E i implies x = y for all i, and E i - anti symmetric if (x, y) E i and (y, x) E i implies x = y (v) E 1 E 2 E n - transitive if for every i and j, E i E j E k for some k, and E i transitive if E i E i E i (vi) an E 1 E 2 E n - hasse diagram if for every positive integer n 2 and every v 0, v 1,..., v n of V, (v i, v i+1 ) E i for all i = 0, 1, 2,..., n 1, implies (v 0, v n ) / E i for all i, and E i - hasse diagram if for every positive integer n 2 and every v 0, v 1,..., v n of V, (v i, v i+1 ) E i for all i = 0, 1, 2,..., n 1, implies (v 0, v n ) / E i, (viii)e 1 E 2 E n - complete if E i = V V, and E i complete if E i = V V. A digraph structure (V ; E 1, E 2,..., E n ) is called (i) an E 1 E 2 E n - quasi ordered set if it is both E 1 E 2 E n - reflexive and E 1 E 2 E n -transitive (ii)an E 1 E 2 E n - partially ordered set if it is E 1 E 2 E n - anti symmetric and E 1 E 2 E n - quasi ordered set. Similarly, we can define E i quasi ordered set and E i partially ordered set as in the case of ordinary relations. An E 1 E 2 E n - walk of length k in a digraph structure is an alternating sequence W = v 0, e 0, v 1,..., e k 1, v k, where e i = (v i, v i+1 ) E i. An E 1 E 2 E n -walk W is called a E 1 E 2 E n - path if all the internal vertices are distinct. We use notation (v 0, v 1, v 2,..., v n ) for the E 1 E 2 E n - path W. As in digraphs, we define E i walk and E i - path. For example, an E i - path between two vertices u and v consists of only E i - edges. A digraph structure (V ; E 1, E 2,..., E n ) is called (i) E 1 E 2 E n - connected if there exits at least one E 1 E 2 E n - path from v to u for all u, v V, (ii)e 1 E 2 E n - quasi connected if for every pair of vertices x, y there is a vertex z such that there is an E 1 E 2 E n -path from z to x and an E 1 E 2 E n -path from z to y, (iii) E 1 E 2 E n - locally connected iff for every pair of vertices u, v V there is an E 1 E 2 E n - path from v to u whenever there is an E 1 E 2 E n - path from u to v and (iv) E 1 E 2 E n - semi connected for every pair of vertices u, v, there is an E 1 E 2 E n - path from u to v or an E 1 E 2 E n - path from v to u. A digraph structure (V ; E 1, E 2,..., E n ) is called E i -connected if there exits at least one E i path from v to u for all u, v V. Similarly we can define E i quasi connected, E i -locally connected and E i - semi connected digraph structures.
3 1768 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, The E 1 E 2 E n - distance between two vertices x and y in a digraph structure G is the length of the shortest E 1 E 2 E n - path between x and y, denoted by d 1,2,3,...,n (x, y). Let G = (V ; E 1, E 2,..., E n ) be a finite E 1 E 2 E n - connected digraph structure. Then the E 1 E 2 E n diameter of G is defined as d(g) = max x,y G {d 1,2,3,...,n (x, y)}. Similarly we can define E i distance and E i diameter as in digraphs. Two digraph structures (V 1 ; E 1, E 2,..., E n ) and (V 2 ; R 1, R 2,..., R m ) are said to be isomorphic if (i) m = n and (ii) there exits a bijective function f : V 1 V 2 such that (x, y) E i (f(x), f(y)) R i. This concept of isomorphism is a generalization of isomorphism between two digraphs. An isomorphism of a digraph structure onto itself is called an automorphism. A digraph structure (V ; E 1, E 2,..., E n ) is said to be vertextransitive if, given any two vertices a and b of V, there is some digraph automorphism f : V V such that f(a) = b. Let (V ; E 1, E 2,..., E n ) be a digraph structure and let v V. Then the E 1 E 2 E n out-degree of u is {v V : (u, v) E i } and E 1 E 2 E n in-degree of u is {v V : (v, u) E i }. Similarly we can define the E i out- degree and E i in- degree as in the case of digraphs. Let (V 1 ; E 1, E 2,..., E n ) be a digraph structure. A vertex v G is called an E 1 E 2 E n -source if for every vertex x G, there is an E 1 E 2 E n - path from v to x. Similarly a vertex u G is called an E 1 E 2 E n - sink if for very vertex y G there is an E 1 E 2 E n - path from y to u. As in digraphs, we define E i - source and E i - sink. Let (V 1 ; E 1, E 2,..., E n ) be a digraph structure and let v G. Then the E 1 E 2 E n reachable set R 1,2,3,,n (u) is {x G : there is an E 1 E 2 E n - path from u to x}. Similarly, the E 1 E 2 E n - antecedent set Q 1,2,...,n (u) is defined as Q 1,2,...,n (u) = {x G : there is an E 1 E 2 E n - path from x to u}. As in the case of digraphs, we can define the E i - reachable set and E i -antecedent set of a vertex. 2. Coset Cayley Digraph Structures In [9] the authors introduced a class of Cayley digraph structures induced by groups. In this paper, we introduce a class of coset Cayley digraph structures induced by groups
4 COSET CAYLEY DIGRAPH STRUCTURES 1769 and prove that every vertex transitive digraph structure is isomorphic to the coset Cayley digraph structure. These class of Cayley digraphs structures can be viewed as a generalization of those obtained in [9]. We start with the following definition: Definition 2.1. Let G be a group and S 1, S 2,..., S n be mutually disjoint subsets of G and H be a subgroup of G. Then coset Cayley digraph structure of G with respect to S 1, S 2,..., S n is defined as the digraph structure (G/H; E 1, E 2,..., E n ), where E i = {(xh, yh) : x 1 y HS i H}. The sets S 1, S 2,..., S n are called connection sets of (G/H; E 1, E 2,..., E n ). We denote the coset Cayley digraph structure of G with respect to S 1, S 2,..., S n by C = Cay(G/H; HS 1 H, HS 2 H,..., HS n H). In this paper, we may use the following notations: Let C be a coset Cayley digraph structure induced by the group G with respect to the connection sets S 1, S 2,..., S n. (1) Let A k be the union of set of all k products of the form (HS i1 H)(HS i2 H) (HS ik H) from the set {HS 1 H, HS 2 H,..., HS n H}. Then k A k. is denoted by [HSH]. (2) Let A 1 k be the union of set of all k products of the form: Then k A 1 k (HS i 1 H)(HS i 2 H) (HS i H). is denoted by [HS 1 H]. (3) Let A be a subset of a group G, then the semigroup generated by A is denoted by < A >. 2.1 Main Theorems Theorem If G is a group and let S 1, S 2,..., S n are mutually disjoint subsets of G and H is a subgroup of G, then the coset Cayley digraph structure C is vertex transitive. Proof. To see that Cay(G/H; HS 1 H, HS 2 H,..., HS n H) is a vertex transitive digraph structure, we first need only show that E i s are well defined. Let x, y, x, y be any four elements of G with xh = x H and yh = y H. Then x = x h 1 and y = y h 2 for some k
5 1770 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, h 1, h 2 H. Observe that (xh, yh) E i x 1 y HS i H (x h 1 ) 1 (y h 2 ) HS i H h 1 1 (x ) 1 y h 2 HS i H (x ) 1 y HS i H (x H, y H) HS i H. Hence each E i s are well defined and hence Cay(G/H; HS 1 H, HS 2 H,..., HS n H) is a digraph structure. Let ah and bh be any two arbitrary elements in G/H. Define a mapping ϕ : G G by ϕ(xh) = ba 1 xh for all xh G/H. This mapping defines a permutation of the vertices of Cay(G/H; HS 1 H, HS 2 H,..., HS n H). It is also an automorphism. Note that (xh, yh) E i x 1 y HS i H (ba 1 x) 1 (ba 1 y) HS i H (ba 1 xh, ba 1 yh) E i (ϕ(xh), ϕ(yh)) E i. Also we note that ϕ(ah) = ba 1 ah = bh. Hence Cay(G/H; HS 1 H, HS 2 H,..., HS n H) is vertex transitive digraph structure. Theorem Let (V ; W 1, W 2,, W n ) be any vertex transitive digraph structure such that V n. Then (V ; W 1, W 2,, W n ) is isomorphic to Cay(G/H; HS 1 H, HS 2 H,..., HS n H).
6 COSET CAYLEY DIGRAPH STRUCTURES 1771 Proof. Let G be the automorphism group of the digraph structure (V ; W 1, W 2,, W n ). Let q 1, q 2,, q n be fixed elements in V. For i = 1, 2,..., n, define the following: H i := {θ G : θ(q i ) = q i }, S i := {θ G : (q i, θ(q i )) W i }. Note that H = n i=1h i is a subgroup of G. Construct the Cayley digraph structure Cay(G/H; HS 1 H, HS 2 H,..., HS n H) as in theorem Define a map ϕ : G/H V by (xh)ϕ = x(q i ) for all xh G/H. where q i is a fixed element in the set {q 1, q 2,..., q n }. (i)ϕ is well defined: Let xh = yh. Then y = xh 1, for some h 1 H. Observe that ϕ(yh) = y(q i ) = (xh 1 )(q i ) = x[h 1 (q i )] = x(q i ) = ϕ(xh) (ii) ϕ is one to one: ϕ(xh) = ϕ(yh) x(q i ) = y(q i ) y 1 x(q i ) = q i y 1 x H xh = yh. (iii) ϕ is onto: Let v be any element in V. Since (V ; W 1, W 2,, W n ) is vertex transitive, there exists an
7 1772 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, automorphism θ such that θ(v) = q i. This implies that v = θ 1 (q i ). That is, v = ϕ(θ 1 H). (iv) ϕ preserves adjacency relation : Observe that (xh, yh) E i x 1 y HS i H x 1 y = h 1 s i h 2 h 1 1 x 1 yh 1 2 = s i S i (q i, (h 1 1 x 1 yh 1 2 )(q i )) W i (h 1 (q i ), x 1 y(q i )) W i (x(q i ), y(q i )) W i (ϕ(xh), ϕ(yh)) W i. 2.2 Corollaries In this section we can prove many graph theoretic properties in terms of algebraic properties. Moreover, these results can be considered as the generalization of those obtained in [9]. Proposition 2.3 The coset Cayley graph structure C is an E 1 E 2 E n -trivial digraph structure S i = for all i. Proof. By definition, C is E 1 E 2 E n - trivial E i = for all i. This implies that S i = for all i. Proposition 2.4 The coset Cayley graph structure C is an E i -trivial digraph structure S i =. Proposition 2.5 The coset Cayley graph structure C is E 1 E 2 E n - reflexive 1 S i for some i.
8 COSET CAYLEY DIGRAPH STRUCTURES 1773 Proof. Assume that C is an E 1 E 2 E n -reflexive digraph structure. Then for every xh G/H, (xh, xh) E i for some i. This implies that 1 HS i H for some i. Conversely, assume that 1 S i for some i. This implies for each xh G/H, (xh, xh) E i for some i. That is, (xh, xh) E i for all x G. Proposition 2.6 The coset Cayley graph structure C is E i - reflexive 1 HS i H. Proposition 2.7 The coset cayley graph structure C is E 1 E 2 E n - symmetric if and only if HS i H = HS 1 i H for all i. Proof. First, assume that C is an E 1 E 2 E n -symmetric digraph structure. Let a HS i H. Then (H, ah) E i. Since C is symmetric (a, 1) E i. This implies that a 1 HS i H. That is a HS 1 i that HS 1 i H HS i H. H. Hence HS i H HS 1 H. Similarly, we can prove Conversely, if HS i H = HS 1 i H, we can prove that C is an E 1 E 2 E n -symmetric digraph structure. Proposition 2.8 C is E i symmetric if and only if HS i H = HS 1 i H. Proposition 2.9 C is an E 1 E 2 E n - transitive if and only if for every i, j, HS i HS j H HS k H for some k. Proof. First, assume that C is E 1 E 2 E n - transitive. We will show that for all (i, j), HS i HS j H HS k H for some k. Let x HS i HS j H = HS i HHS j H. Then i x = z 1 z 2 for some z 1 HS i H, z 2 HS j H This implies that (H, z 1 H) E i and (z 1 H, z 1 z 2 H) E j. Since C is E 1 E 2 E n - transitive, (H, z 1 z 2 H) HS k H for some k. That is z 1 z 2 HS k H. Hence HS i HS j H HS k H. Conversely, assume that all (i, j), HS i HS j H HS k H for some k. We will show that C is E 1 E 2 E n - transitive. Let (H, xh) E i, (xh, yh) E j. Then x HS i H and x 1 y HS j H. This implies that y = xx 1 y HS i HS j H. Since HS i HS j H HS k H, we have y HS k H. It follows that (H, yh) E k.
9 1774 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, Proposition 2.10 C is an E 1 E 2 E n -k- transitive if and only if for every i 1, i 2,..., i k {1, 2,..., k}, we have (HS i1 H)(HS i2 H) (HS ik H) (HS j1 H) for some j 1 ; (HS i1 H)(HS i2 H) (HS ik 1 H) (HS j2 H) for some j 2 ;. (HS i1 H)(HS i2 H) (HS jk 1 H) for some j 1. Proof. First, assume that C is an E 1 E 2 E n -k- transitive. Let x (HS i1 H)(HS i2 H) (HS ik H). Then there exits z j (HS ij H), j = 1, 2,..., k such that x = z 1 z 2 z k. This implies that (H, z 1 H, z 1 z 2 H, z 1 z 2 z 3 H,..., z 1 z 2 z 3... z k H) is a path from 1 to x. Since C is an E 1 E 2 E n -k- transitive, we have (H, z 1 z 2 z 3... z k H) E j1 for some j 1, (H, z 1 z 2 z 3... z k 1 H) E j1 for some j 2,. (H, z 1 z 2 H) E jk 1 for some j k 1. The above statements tells us that (HS i1 H)(HS i2 H) (HS ik H) (HS j1 H) for some j 1 ; (HS i1 H)(HS i2 H) (HS ik 1 H) (HS j2 H) for some j 2 ;. (HS i1 H)(HS i2 H) (HS jk 1 H) for some j k 1. Conversely, assume that the above conditions holds. Let x 1 H, x 2 H,..., x n H G/H such that (x 1 H, x 2 H) E i1, (x 2 H, x 3 H) E i2,..., (x k 1 H, x n H) E ik. Then x 2 = x 1 t 1, x 3 = x 2 t 2,..., x k = x k 1 t k 1
10 COSET CAYLEY DIGRAPH STRUCTURES 1775 for some t i HS i1 H. The above equations can be written as: x 3 = x 1 (t 1 t 2 ) x 4 = x 1 (t 1 t 2 t 3 ). x k 1 = x 1 (t 1 t 2 t n ) The above equations tells as that (x 1 H, x 3 H) E i1, (x 1 H, x 4 H) E i2,..., (x 1 H, x k 1 H) E ik 1. This completes the proof. Proposition 2.11 C is an E i -k- transitive if and only if (HS i H) n (HS i H) for n = 2, 3,..., k. Proposition 2.12 C is E 1 E 2 E n -complete if and only if G = HS i H. Proof. Suppose C is E 1 E 2 E n complete. Then for every xh G/H, we have (H, xh) E i. This implies that x HS i H for some i. This implies that G = HS i H. Conversely, assume that G = HS i H. Let xh and yh be two arbitrary elements in G/H such that y = xz. Then z G. This implies that z HS i H for some i. That is, (H, zh) E i. That is (xh, xzh) = (xh, yh) E i. This shows that C is complete. Proposition 2.13 C is E i complete if and only if G = HS i H. Proposition 2.14 C is E 1 E 2 E n connected if and only if G = [HSH]. Proof. Suppose C is E 1 E 2 E n connected and let xh G/H. Let (H, y 1 H, y 2 H,..., y n H, xh) be an E 1 E 2 E n - path leading from H to xh. Then y 1 HS i1 H for some i 1 ; y 1 1 y 2 HS i2 H for some i 2 ; y 1 2 y 3 HS i3 H for some i 3 ;. y 1 n x HS in+1 H for some i n+1.
11 1776 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, Note that x = y 1 y1 1 y 2 y2 1 y 3 y 1 x. Hence from the above equations, we have: n x (HS i1 H)(HS i2 H)(HS i3 H) (HS in H) [HSH]. Since x is arbitrary, G = [HSH]. Conversely, assume that G = [HSH]. Let x and y be any arbitrary elements in G. Let y = xz. Then z G. That is, z (HS i H)(HS j H) (HS k H) for some i, j,... and k. This implies that z = s i s j... s k for some i, j... and k. Then clearly, (H, s i H, s i s j H,..., s i s j... s k H) is an E 1 E 2 E n - path from H to zh. That is (xh, xs i H, xs i s j H,..., xs i s j... s k H) is a E 1 E 2 E n - path from xh to yh. Hence C is connected. Proposition 2.15 C is E i connected if and only if G =< HS i H >, where < HS i H > is the semigroup generated by HS i H. Proposition 2.16 C is E 1 E 2 E n quasi connected if and only if G = [HSH] 1 [HSH]. Proof. First, assume that C is quasi strongly connected. Let xh be any arbitrary element in G/H. Then there exits a vertex yh G such that there is a path from yh to xh, say: (yh, y 1 H, y 2 H,, y n H, H) and a path from yh to H, say: (yh, x 1 H, x 2 H,..., x m H, xh). Then we have the following system of equations: y 1 y 1 HS i1 H; y 1 1 y 2 HS i2 H; (1) y 1 2 y 3 HS i3 H;. y 1 n HS in+1 H. and y 1 x 1 HS i1 H; x 1 1 x 2 HS i2 H; (2) x 1 2 x 3 HS i3 H;. x 1 m x HS im+1 H.
12 From equation (1) we obtain the following: COSET CAYLEY DIGRAPH STRUCTURES 1777 y 1 = (y 1 y 1 )(y1 1 y 2 )(y2 1 y 3 ) (yn 1 ) S i2 (HS i1 H)(HS i2 H) (HS in+1 H). This implies that (3) y (HS 1 i 1 H)(HS 1 H) (HS 1 i n+1 H) [HS 1 H]. Similarly, from equation (2) we obtain the following: i 2 (4) y 1 x = (y 1 x 1 )(x 1 1 x 2 ) (x 1 m x) (HS i1 H)(HS i2 H) (HS im+1 H). That is That is Since x is arbitrary, we have y 1 x [HSH]. x y[hsh] [HS 1 H][HSH]. G = [HS 1 H][HSH]. Conversely, assume that G = [HS 1 H][HSH]. Let x and y be two arbitrary vertices in G. Let y = xz. Then z G. This implies that z [HS 1 H][HSH]. Then there exits z 1 [HS 1 H] and z 2 [HSH] such that z = z 1 z 2. z 1 [HS 1 H] implies that there exits t k HS ik H such that This implies that is a path from z 1 H to H. That is is a path from yz 1 H to yh. z 1 = t 1 t 2... t n for some t k HS 1 i k H, k = 1, 2,..., n. (z 1 H, t 1 t 2 H... t n 1,..., H) (yz 1 H, yt 1 t 2 H... t n 1 H,..., yh) Similarly, z 2 [HSH] implies that there exits a k S ik such that z 2 = a 1 a 2... a m.
13 1778 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, Observe that is a path from z 2 H to H. That is, is a path from zh to z 1 H. That is is a path from xh to z 1 H. (z 2 H, a 1 a 2 H, a 1 a 2 a 3 H,..., H) (z 1 z 2 H, z 1 a 1 a 2 H, a 1 a 2 a 3 H,..., z 1 H) (yzh, yz 1 a 1 a 2 H, ya 1 a 2 a 3 H,..., z 1 H) Proposition 2.17 C is E i - quasi connected if and only if G =< HS 1 i H >< HS i H >. Proposition 2.18 C is E 1 E 2 E n - locally connected if and only if [HSH] = [HS 1 H]. Proof. Assume that C is E 1 E 2 E n - locally connected. Let x [HSH]. Then x A m for some m. Then x = s i s j... s m. Let x 0 = 1, x 1 = s i, x 2 = s i s j,..., x m = s i s j... s m. Then (x 0 H, x 1 H, x 2 H,..., x m H) is a path leading from 1 to x. Since C is locally connected, there exits a path from xh to H, say: This implies that (xh, y 1 H, y 2 H,..., y m H, H) x 1 y 1 S i1 y 1 1 y 2 S i2 y 1 m. S in The above equations tells us that x 1 [HSH]. That is x [HS 1 H]. Hence [HSH] = [HS 1 H]. Conversely, if [HSH] = [HS 1 H], one can easily verify that C is E 1 E 2 E n - locally connected.
14 COSET CAYLEY DIGRAPH STRUCTURES 1779 Proposition 2.19 C is E i - locally connected if and only if < HS 1 i H >=< HS i H >. Proposition 2.20 C is E 1 E 2 E n - semi connected if and only if G = [HSH] [HS 1 H]. Proof. Assume that C is E 1 E 2 E n - semi connected and let xh G/H. Then there is a path from H to xh, say or a path from xh to H, say (H, x 1 H, x 2 H,, x n H, xh) (xh, y 1 H, y 2 H,, y m H, H) This implies that x [HSH] or x [HS 1 H]. This implies that G = [HSH] [HS 1 H]. Similarly, if G = [HSH] [HS 1 H], then one can prove that C is E 1 E 2 E n - semi connected. Proposition 2.21 C is E i - semi connected if and only if G =< HS i H > < HS 1 i H >. Proposition 2.22 C is an E 1 E 2 E n - quasi ordered set if and only if (i)1 (HS 1 H) (HS 2 H) (HS n H), (ii)for every(i, j), HS i HS j H HS k H for some k. Proposition 2.23 C is an E i quasi ordered set if and only if (i)1 HS i H, (ii)(hs i H) 2 HS i H. Proposition 2.24 C if an E 1 E 2 E n - partially ordered set if and only if (i)1 (HS 1 H) (HS 2 H) (HS n H), (ii)for every(i, j), (HS i H)(HS j H) (HS k H) for some k, (iii) (HS i H) (HS 1 i H) = {1}. Proof. Observe that x (HS i H) H(S i ) 1 H x (HS i H) (HS 1 i H) for some i
15 1780 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, x HS i H and x HS 1 i H (H, xh) E i and (xh, H) E i x = 1. Proposition 2.25 C if an E i partially ordered set if and only if (i)1 HS i H, (ii)(hs i H) 2 HS i H (iii)(hs i H) (HS 1 i H) = {1} Proposition 2.26 Let A m (m 2) is the set of m products of the form S i1 S i2 S im. Then C is an E 1 E 2 E n - hasse diagram if and only if C S i = for all i and for all C A m. Proof. Suppose the condition holds. Let x 0 H, x 1 H,..., x m H be (m + 1) elements in G/H such that (x i H, x i+1 H) E i for i = 0, 1,..., m 1. This implies that x 1 0 x 1 S i1 ; x 1 1 x 2 S i2 ; x 1 2 x 3 3 S i3 ; x 1 m 1x m S im.. The above equation tells us that x 1 0 x m A m. Since C S i = for all i and for all C A m, (x 0, x m ) / E i. Conversely assume that C is an E 1 E 2 E n hasse diagram. We will show that C S i = for all i and for all C A m. Let S i1 S i2 S i3 S im be any element in A m. Let x S i1 S i2 S i3 S im. Then x = s i1 s i2 s i3... s in for some s ik S ik. This implies that (H, s i1 H, s i2 s i3 H,..., xh)
16 COSET CAYLEY DIGRAPH STRUCTURES 1781 is a path from H to xh. Since C is an E 1 E 2 E n hasse- diagram, x / S i for any i. That is, A m S i = for all i. Proposition 2.27 The E 1 E 2 E n out-degree of C is the cardinal number S 1 S 2 S n /H. Proof. Since C is vertex- transitive it suffices to consider the out degree of the vertex H G/H. Observe that ρ(h) = {uh : (H, uh) E} = {uh : u HS i H for some i} = (HS 1 H) (HS 2 H) (HS n H)/H Hence ρ(h) = (HS 1 H) (HS 2 H) (HS n H)/H. Proposition 2.28 The E i out-degree of C is the cardinal number HS i H/H. Proposition 2.29 The E 1 E 2 E n in-degree of C is the cardinal number (HS 1 1 H) (HS2 1 H) (HS 1 H)/H. n Proof. Since C is vertex- transitive it suffices to consider the in degree of the vertex H G/H. Observe that σ(h) = {uh : (uh, H) E} = {uh : (uh, H) E i } = {uh : u 1 HS i H} = {uh : u HS 1 i H} Hence σ(h) = (HS1 1 H) (HS2 1 H) (HS 1 H)/H. Proposition 2.30 The E i in-degree of C is the cardinal number HS 1 i H/H. Proposition 2.31 For k = 1, 2, 3,... let A k n be the set of all k products of the form (HS i1 H)(HS i2 H) (HS ik H). If C has finite diameter, then the diameter of C is the least positive integer m such that G = A m
17 1782 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, Proof.Let m be the smallest positive integer such that G = A m. We will show that the diameter of C is m. Let xh and yh be any two arbitrary elements in G such that y = xz. Then z G. This implies that x A m. But then z has a representation of the form x = s i1 s i2 s im. This implies that is path of m edges from H to zh. That is (H, s i1 H, s i1 s i2 H,..., zh) (xh, xs i1 H, xs i1 s i2 H,..., yh) is a path of length m from xh to yh. This shows that d(xh, yh) n. Since xh and yh are arbitrary, max xh,yh G {d 1,2,,n (xh, yh)} m Therefore the diameter of C is less than or equal to n. On the other hand let the diameter of C be k. Let x G and d 1,2,,n (H, xh) = k. Then we have x B for some B A k. That is G = A k Now by the minimality of k, we have m k. Hence k = m. Proposition 2.32 The vertex H is an E 1 E 2 E n - source of C if and only if G = [HSH]. Proof. First, assume that H is an E 1 E 2 E n -source of C. Then for any vertex xh G/H, there is an E 1 E 2 E n - path from H to xh. This implies that G = [HSH]. Conversely, if G = [HSH], one can prove that H is an E 1 E 2 E n - source. Proposition 2.33 The vertex H is an E i - source of C if and only if G =< HS i H >. Proposition 2.34 The vertex H is an E 1 E 2 E n - sink of C if and only if G = [HS 1 H]. Proof. First, assume that H is an E 1 E 2 E n -sink of C. Then for each xh G/H, there is an E 1 E 2 E n - path from xh to H. This implies that x [HS 1 H]. Hence G = [HS 1 H]. Conversely, if G = [HS 1 H], one can easily prove that H is an E 1 E 2 E n -sink of C. Proposition 2.35 The vertex H is an E i sink of C if and only if G =< HS 1 i H >.
18 COSET CAYLEY DIGRAPH STRUCTURES 1783 Proposition 2.36 The E 1 E 2 E n - reachable set R 1,2,...,n (H) of the vertex H is the set [HSH]. Proof. By definition, R(H) = {xh : there exits an E 1 E 2 E n - path from H to xh} Observe that xh R 1,2,...,n (H) there exits an E 1 E 2 E n -path from H to xh, say (H, x 1 H, x 2 H,..., x n H, xh) x [HSH] Therefore, R 1,2,3,,n (H) = [HSH]. Proposition 2.37 The E i reachable set R i (H) of the vertex H is the set < S i >. Proposition 2.38 The E 1 E 2 E n - antecedent set Q 1,2,...,n (H) of the vertex H is the set [HS 1 H]. Proof. Observe that x Q 1,2,...,n (H) there exits an E 1 E 2 E n path from xh to H, say (xh, x 1 H, x 2 H,..., x n H, H) x [HS 1 H]. Q 1,2,...,n (H) = [HS 1 H]. Proposition 2.39 The E i antecedent set Q i (H) of the vertex H is the set < HS 1 i H >. References [1] B. Alspach and C. Q. Zhang, Hamilton cycles in cubic Cayley graphs on dihedral groups, Ars Combin. 28 (1989), [2] B. Alspach, S. Locke and D. Witte, The Hamilton spaces of Cayley graphs on abelian groups, Discrete Math. 82 (1990), [3] B. Alspach and Y. Qin, Hamilton-connected Cayley graphs on hamiltonian groups, Europ. J. Combin. 22 (2001),
19 1784 ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, [4] C. Godsil and R. Gordon, Algebraic Graph Theory, Graduate Texts in Mathematics, New York: Springer-Verlag, [5] D. Witte and K. Keating, On hamilton cycles in Cayley graphs in groups with cyclic commutator subgroup, Ann. Discrete Math. 27 (1985), [6] E. Dobson, Automorphism groups of metacirculant graphs of order a product ot two distinct primes, Combinatorics, Probability and Computing 15(2006), [7] G. Sabidussi, On a class of fixed-point-free graphs, Proc. Amer. Math. Soc. 9(1958), [8] J. B. Fraleigh, A First course in abstract algebra, Pearson Education, [9] Kumar V., Anil and Nair Parameswaran Ashok, A class of Cayley digraph structures induced by groups, Journal of Mathematics Research 4(2) (2012), [10] Kumar V. Anil, A class of double coset Cayley digraphs induced by loops, International Journal of Algebra 22(5) (2011), [11] S. B. Akers and B. Krishamurthy, A group theoritic model for symmetric interconnection networks, IEEE Trans. comput. 38 (1989), [12] S. J. Curran and J. A. Gallian, Hamiltonian cycles and paths in cayley graphs and digraphs- A survey, Discrete Math., 156 (1996) [13] S.Lakshmivarahan, J. Jwo and S. K. Dhall, Symmetry in interconnection networks based on cayley graphs of permutation groups- A survey, Parallel Comput. 19(1993),
Generalized Cayley Digraphs
Pure Mathematical Sciences, Vol. 1, 2012, no. 1, 1-12 Generalized Cayley Digraphs Anil Kumar V. Department of Mathematics, University of Calicut Malappuram, Kerala, India 673 635 anilashwin2003@yahoo.com
More informationON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 53, No. 2, 2012, 79 87 ON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS ADRIÁN PASTINE AND DANIEL JAUME Abstract. In this paper we
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationHAMILTON CYCLES IN CAYLEY GRAPHS
Hamiltonicity of (2, s, 3)- University of Primorska July, 2011 Hamiltonicity of (2, s, 3)- Lovász, 1969 Does every connected vertex-transitive graph have a Hamilton path? Hamiltonicity of (2, s, 3)- Hamiltonicity
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationConnectivity of Cayley Graphs: A Special Family
Connectivity of Cayley Graphs: A Special Family Joy Morris Department of Mathematics and Statistics Trent University Peterborough, Ont. K9J 7B8 January 12, 2004 1 Introduction Taking any finite group G,
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationDEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY
HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both
More informationExamples: The (left or right) cosets of the subgroup H = 11 in U(30) = {1, 7, 11, 13, 17, 19, 23, 29} are
Cosets Let H be a subset of the group G. (Usually, H is chosen to be a subgroup of G.) If a G, then we denote by ah the subset {ah h H}, the left coset of H containing a. Similarly, Ha = {ha h H} is the
More informationNormal Subgroups and Factor Groups
Normal Subgroups and Factor Groups Subject: Mathematics Course Developer: Harshdeep Singh Department/ College: Assistant Professor, Department of Mathematics, Sri Venkateswara College, University of Delhi
More informationCourse 311: Abstract Algebra Academic year
Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................
More informationMaximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector
Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector MI Bueno, Department of Mathematics and The College of Creative Studies University of California,
More information1.1 Definition. A monoid is a set M together with a map. 1.3 Definition. A monoid is commutative if x y = y x for all x, y M.
1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M M M, (x, y) x y such that (i) (x y) z = x (y z) x, y, z M (associativity); (ii) e M such that x e = e x = x for all x M (e
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationDISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents
DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions
More informationDIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS
DIGRAPHS WITH SMALL AUTOMORPHISM GROUPS THAT ARE CAYLEY ON TWO NONISOMORPHIC GROUPS LUKE MORGAN, JOY MORRIS, AND GABRIEL VERRET Abstract. Let Γ = Cay(G, S) be a Cayley digraph on a group G and let A =
More informationIntroduction to Groups
Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)
More informationTeddy Einstein Math 4320
Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective
More information2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS
Volume 7, Number 1, Pages 41 47 ISSN 1715-0868 2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS DAVE WITTE MORRIS Abstract. Suppose G is a nilpotent, finite group. We show that if
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationGroup. Orders. Review. Orders: example. Subgroups. Theorem: Let x be an element of G. The order of x divides the order of G
Victor Adamchik Danny Sleator Great Theoretical Ideas In Computer Science Algebraic Structures: Group Theory II CS 15-251 Spring 2010 Lecture 17 Mar. 17, 2010 Carnegie Mellon University Group A group G
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More information7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup
More informationBASIC GROUP THEORY : G G G,
BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e
More informationFINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1
Novi Sad J. Math. Vol. 40, No. 3, 2010, 83 87 Proc. 3rd Novi Sad Algebraic Conf. (eds. I. Dolinka, P. Marković) FINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1 Dragan Mašulović
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationA Class of Vertex Transitive Graphs
Volume 119 No. 16 2018, 3137-3144 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ A Class of Vertex Transitive Graphs 1 N. Murugesan, 2 R. Anitha 1 Assistant
More informationMath 4400, Spring 08, Sample problems Final Exam.
Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationHAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS.
HAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS. MARY STELOW Abstract. Cayley graphs and digraphs are introduced, and their importance and utility in group theory is formally shown.
More informationB Sc MATHEMATICS ABSTRACT ALGEBRA
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc MATHEMATICS (0 Admission Onwards) V Semester Core Course ABSTRACT ALGEBRA QUESTION BANK () Which of the following defines a binary operation on Z
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationAlgebraic Properties and Panconnectivity of Folded Hypercubes
Algebraic Properties and Panconnectivity of Folded Hypercubes Meijie Ma a Jun-Ming Xu b a School of Mathematics and System Science, Shandong University Jinan, 50100, China b Department of Mathematics,
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationIsomorphic Cayley Graphs on Nonisomorphic Groups
Isomorphic Cayley raphs on Nonisomorphic roups Joy Morris Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC. V5A 1S6. CANADA. morris@cs.sfu.ca January 12, 2004 Abstract: The
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationLocally primitive normal Cayley graphs of metacyclic groups
Locally primitive normal Cayley graphs of metacyclic groups Jiangmin Pan Department of Mathematics, School of Mathematics and Statistics, Yunnan University, Kunming 650031, P. R. China jmpan@ynu.edu.cn
More informationModule MA3411: Galois Theory Michaelmas Term 2009
Module MA3411: Galois Theory Michaelmas Term 2009 D. R. Wilkins Copyright c David R. Wilkins 1997 2009 Contents 1 Basic Concepts and Results of Group Theory 1 1.1 Groups...............................
More informationCOLLAPSING PERMUTATION GROUPS
COLLAPSING PERMUTATION GROUPS KEITH A. KEARNES AND ÁGNES SZENDREI Abstract. It is shown in [3] that any nonregular quasiprimitive permutation group is collapsing. In this paper we describe a wider class
More informationSelf-complementary circulant graphs
Self-complementary circulant graphs Brian Alspach Joy Morris Department of Mathematics and Statistics Burnaby, British Columbia Canada V5A 1S6 V. Vilfred Department of Mathematics St. Jude s College Thoothoor
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationReachability relations and the structure of transitive digraphs
Reachability relations and the structure of transitive digraphs Norbert Seifter Montanuniversität Leoben, Leoben, Austria seifter@unileoben.ac.at Vladimir I. Trofimov Russian Academy of Sciences, Ekaterinburg,
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
More informationAutomorphism group of the balanced hypercube
Abstract Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 12 (2017) 145 154 Automorphism group of the balanced hypercube
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationEvery generalized quadrangle of order 5 having a regular point is symplectic
Every generalized quadrangle of order 5 having a regular point is symplectic Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationSHUHONG GAO AND BETH NOVICK
FAULT TOLERANCE OF CAYLEY GRAPHS SHUHONG GAO AND BETH NOVICK Abstract. It is a difficult problem in general to decide whether a Cayley graph Cay(G; S) is connected where G is an arbitrary finite group
More informationarxiv: v2 [math.gr] 7 Nov 2015
ON SCHUR 3-GROUPS GRIGORY RYABOV arxiv:1502.04615v2 [math.gr] 7 Nov 2015 Abstract. Let G be a finite group. If Γ is a permutation group with G right Γ Sym(G) and S is the set of orbits of the stabilizer
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationRegular actions of groups and inverse semigroups on combinatorial structures
Regular actions of groups and inverse semigroups on combinatorial structures Tatiana Jajcayová Comenius University, Bratislava CSA 2016, Lisbon August 1, 2016 (joint work with Robert Jajcay) Group of Automorphisms
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationDERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine
DERIVATIONS Introduction to non-associative algebra OR Playing havoc with the product rule? PART VI COHOMOLOGY OF LIE ALGEBRAS BERNARD RUSSO University of California, Irvine FULLERTON COLLEGE DEPARTMENT
More informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
More informationReachability relations and the structure of transitive digraphs
Reachability relations and the structure of transitive digraphs Norbert Seifter Montanuniversität Leoben, Leoben, Austria Vladimir I. Trofimov Russian Academy of Sciences, Ekaterinburg, Russia November
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationA note on the Isomorphism Problem for Monomial Digraphs
A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University
More informationPartial, Total, and Lattice Orders in Group Theory
Partial, Total, and Lattice Orders in Group Theory Hayden Harper Department of Mathematics and Computer Science University of Puget Sound April 23, 2016 Copyright c 2016 Hayden Harper. Permission is granted
More informationMaximal non-commuting subsets of groups
Maximal non-commuting subsets of groups Umut Işık March 29, 2005 Abstract Given a finite group G, we consider the problem of finding the maximal size nc(g) of subsets of G that have the property that no
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationMA441: Algebraic Structures I. Lecture 26
MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order
More information- Fuzzy Subgroups. P.K. Sharma. Department of Mathematics, D.A.V. College, Jalandhar City, Punjab, India
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 47-59 Research India Publications http://www.ripublication.com - Fuzzy Subgroups P.K. Sharma Department
More informationSPECTRUM OF (k, r) - REGULAR HYPERGRAPH
SPECTRUM OF (k, r) - REGULAR HYPERGRAPH K Reji Kumar 1 and Renny P Varghese Abstract. We present a spectral theory of uniform, regular and linear hypergraph. The main result are the nature of the eigen
More informationTheorems and Definitions in Group Theory
Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3
More informationRohit Garg Roll no Dr. Deepak Gumber
FINITE -GROUPS IN WHICH EACH CENTRAL AUTOMORPHISM FIXES THE CENTER ELEMENTWISE Thesis submitted in partial fulfillment of the requirement for the award of the degree of Masters of Science In Mathematics
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationModule MA3411: Abstract Algebra Galois Theory Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents 1 Basic Principles of Group Theory 1 1.1 Groups...............................
More informationHomework #11 Solutions
Homework #11 Solutions p 166, #18 We start by counting the elements in D m and D n, respectively, of order 2. If x D m and x 2 then either x is a flip or x is a rotation of order 2. The subgroup of rotations
More informationFields and Galois Theory. Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory.
Fields and Galois Theory Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory. This should be a reasonably logical ordering, so that a result here should
More informationIIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1
IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1 Let Σ be the set of all symmetries of the plane Π. 1. Give examples of s, t Σ such that st ts. 2. If s, t Σ agree on three non-collinear points, then
More informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
More informationRough Anti-homomorphism on a Rough Group
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 6, Number 2 (2014), pp. 79 87 International Research Publication House http://www.irphouse.com Rough Anti-homomorphism
More informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationSimplification by Truth Table and without Truth Table
Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of
More informationBlock Introduction. Some self study examples and proof of the theorems are left to the readers to check their progress.
Abstract Algebra The word Algebra is derived from the Arabic word al-jabr. Classically, algebra involves the study of equations and a number of problems that devoted out of the theory of equations. Then
More informationCosets, factor groups, direct products, homomorphisms, isomorphisms
Cosets, factor groups, direct products, homomorphisms, isomorphisms Sergei Silvestrov Spring term 2011, Lecture 11 Contents of the lecture Cosets and the theorem of Lagrange. Direct products and finitely
More informationHomework #5 Solutions
Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will
More informationCHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).
CHAPTEER - TWO SUBGROUPS Definition 2-1. Let (G, ) be a group and H G be a nonempty subset of G. The pair ( H, ) is said to be a SUBGROUP of (G, ) if ( H, ) is group. Example. ( Z, + ) is subgroup of (
More informationENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.
ENTRY GROUP THEORY [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld Group theory [Group theory] is studies algebraic objects called groups.
More informationLecture Note of Week 2
Lecture Note of Week 2 2. Homomorphisms and Subgroups (2.1) Let G and H be groups. A map f : G H is a homomorphism if for all x, y G, f(xy) = f(x)f(y). f is an isomorphism if it is bijective. If f : G
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationA Family of One-regular Graphs of Valency 4
Europ. J. Combinatorics (1997) 18, 59 64 A Family of One-regular Graphs of Valency 4 D RAGAN M ARUSä ICä A graph is said to be one - regular if its automorphism group acts regularly on the set of its arcs.
More informationON THE RELATIONSHIP BETWEEN SETS AND GROUPS
ON THE RELATIONSHIP BETWEEN SETS AND GROUPS ROSE DONG Abstract. This paper is an introduction to basic properties of sets and groups. After introducing the notion of cardinal arithmetic, it proves the
More informationHAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS
HAMILTONICITY OF VERTEX-TRANSITIVE GRAPHS University of Primorska & University of Ljubljana June, 2011 Announcing two opening positions at UP Famnit / Pint in 2011/12 Young Research position = PhD Grant
More informationA GENERAL THEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUTATIVE RING. David F. Anderson and Elizabeth F. Lewis
International Electronic Journal of Algebra Volume 20 (2016) 111-135 A GENERAL HEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUAIVE RING David F. Anderson and Elizabeth F. Lewis Received: 28 April 2016 Communicated
More informationOdd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 1 28 Odd-order Cayley graphs with commutator subgroup of order
More informationChapter 16 MSM2P2 Symmetry And Groups
Chapter 16 MSM2P2 Symmetry And Groups 16.1 Symmetry 16.1.1 Symmetries Of The Square Definition 1 A symmetry is a function from an object to itself such that for any two points a and b in the object, the
More informationSUPPLEMENT ON THE SYMMETRIC GROUP
SUPPLEMENT ON THE SYMMETRIC GROUP RUSS WOODROOFE I presented a couple of aspects of the theory of the symmetric group S n differently than what is in Herstein. These notes will sketch this material. You
More informationIdentifying Graph Automorphisms Using Determining Sets
Identifying Graph Automorphisms Using Determining Sets Debra L. Boutin Department of Mathematics Hamilton College, Clinton, NY 13323 dboutin@hamilton.edu Submitted: May 31, 2006; Accepted: Aug 22, 2006;
More informationON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS
ON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS OLGA VARGHESE Abstract. Graph products and Coxeter groups are defined via vertex-edge-labeled graphs. We show that if the graph has a special shape, then
More informationMath 3140 Fall 2012 Assignment #3
Math 3140 Fall 2012 Assignment #3 Due Fri., Sept. 21. Remember to cite your sources, including the people you talk to. My solutions will repeatedly use the following proposition from class: Proposition
More informationWhat s category theory, anyway? Dedicated to the memory of Dietmar Schumacher ( )
What s category theory, anyway? Dedicated to the memory of Dietmar Schumacher (1935-2014) Robert Paré November 7, 2014 Many subjects How many subjects are there in mathematics? Many subjects How many subjects
More informationHamiltonian circuits in Cayley digraphs. Dan Isaksen. Wayne State University
Hamiltonian circuits in Cayley digraphs Dan Isaksen Wayne State University 1 Digraphs Definition. A digraph is a set V and a subset E of V V. The elements of V are called vertices. We think of vertices
More informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More information