1 Introductory remarks Throughout this paper graphs are nite, simple and undirected. Adopting the terminology of Tutte [11], a k-arc in a graph X is a
|
|
- Hester Hunter
- 5 years ago
- Views:
Transcription
1 ON 2-ARC-TRANSITIVE CAYLEY GRAPHS OF DIHEDRAL GROUPS Dragan Marusic 1 IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija Abstract A partial extension of the results in [1], where 2-arc-transitive circulants are classied, is given. It is proved that a 2-arc-transitive Cayley graph of a dihedral group is either a complete graph or a bipartite graph. Keywords: permutation group, imprimitive group, dihedral group, Cayley graph, 2-arc-transitive graph. 1 Supported in part by the Ministrstvo za znanost in tehnologijo Slovenije, project no. J
2 1 Introductory remarks Throughout this paper graphs are nite, simple and undirected. Adopting the terminology of Tutte [11], a k-arc in a graph X is a sequence of k + 1 vertices v 1 ; v 2 ; : : : ; v k+1 of X, not necessarily all distinct, such that any two consecutive terms are adjacent and any three consecutive terms are distinct. A graph X is said to be k-arc-transitive if the automorphism group of X, denoted Aut X, acts transitively on the k-arcs of X. Let X be a 2-arc-transitive graph and let v 2 V (X). It is not dicult to see that the restriction of the vertex stabilizer (Aut X) v to the set of neighbors N(v) of v is a doubly transitive group (see [9, Lemma 9.4]. As a byproduct of the classication of nite simple groups all doubly transitive groups are known [3]. With this information an organized eort has been set in motion to understand the structure of 2-arc-transitive graphs via an analysis of possible (doubly transitive) restrictions of the corresponding vertex stabilizers, resulting in a series of papers dealing with particular families of doubly transitive groups [2, 5, 6] (see [9] for a complete survey). From a somewhat dierent perspective, in [1] a classication of 2-arc-transitive circulants, that is Cayley graphs of nite cyclic groups, was given. Proposition 1.1 ([1, Theorem 1.1]) A 2-arc-transitive circulant is either a cycle or a complete graph, or a complete bipartite graph, or the complete bipartite graph minus a 1-factor K m;m? mk 2, where m is odd. Here we generalize the above result by partially extending it to 2-arctransitive Cayley graphs of dihedral groups. The following is thus the main result of this paper. Theorem 1.2 A connected, 2-arc-transitive Cayley graph of a dihedral group of order 2n, n 3, is either (i) the cycle C 2n, which is k-arc-transitive for any k 2; or (ii) the complete graph K 2n, which is 2-arc-transitive but not 3-arc-transitive; or (ii) a bipartite graph of valency at least 3. In Section 2 we describe some of the tools and conventions and prove some results that are needed in the proof of Theorem 1.2, carried out in Section 3. 2
3 2 Preliminary concepts Letting S be an arbitrary subset of Z n nf0g such that S =?S, and letting T be an arbitrary subset of Z n, we denote by X(2n; S; T ) the graph with vertex set fu i : i 2 Z n g [ fv i : i 2 Z n g, and edges of the form u i u i+s, v i v i+s, for all i 2 Z n and s 2 S, and u i v i+t, for all i 2 Z n and t 2 T. The ordered pair (S; T ) is said to be a symbol of X(2n; S; T ). Note that Aut X(2n; S; T ) contains a regular dihedral group generated by the automorphisms and mapping according to the rules: and u i = u i+1 ; v i = v i+1 ; i 2 Z n ; u i = v?i ; v i = u?i ; i 2 Z n : On the other hand, it is not dicult to see that for every Cayley graph X of a dihedral group with 2n elements there exists an ordered pair (S; T ), where S is a symmetric subset of Z n nf0g and T is a subset of Z n, such that X is isomorphic to the graph X(2n; S; T ). For the purpose of this paper a Cayley graph of a dihedral group will be referred to as a dihedrant and any corresponding ordered pair (S; T ) in the above denition as its symbol. Proposition 2.1 Let X = X(2n; S; T ) be a connected dihedrant of degree at least 3. Then the girth of X is (i) at most 4 if S 6= ;; (ii) and at most 6 if S = ;. Proof. Note that T 6= ; since X is connected. To prove (i), let s 2 S and t 2 T. Then u 0 ; u s ; v s+t ; v t ; u 0 is a 4-cycle in X. Next, to prove (ii), let t; t 0 ; t 00 2 T be distinct. Then u 0 ; v t ; u t?t 0; v t?t0 +t 00; u t 00?t 0; v t 00; u 0 is a 6-cycle of X. The next result is taken from [1, Proposition 1.2] and allows us to consider only dihedrants of girth 4 or more. Proposition 2.2 If X is a connected 2-arc-transitive graph of girth 3, then X = K n for some n. 3
4 Let Y be a graph, let k be a positive integer, and let f : A(Y )?! S k be a permutation voltage assignment, that is a function from the set of arcs of Y into the symmetric group S k where reverse arcs carry inverse voltages. We thus have a labeling of the arcs of Y by permutations in S k such that f u;v f v;u = id for all pairs of adjacent vertices u; v in Y, where f u;v denotes the permutation assigned to the arc (u,v). The voltage assignment f naturally extends to walks in Y. In particular, for any cycle C = v 1 v 2 : : : v r v 1 of Y we let f C denote the voltage f v1 ;v 2 f v2 ;v 3 : : : f vr;v 1 of C, that is the f-voltage of C. The covering graph X = Cov(Y; f) of Y with respect to f has vertex set V (Y ) Z k, and edges of the form (u; r)(v; s), where u; v 2 E(Y ), r 2 Z k and s = r f u;v. The graph Y is said to be the base graph of X, and the latter is sometimes referred to as a k-fold cover of Y. The set of vertices (u; 0); (u; 1); : : : ; (u; k? 1) is called the bre of u. The subgroup of all those automorphisms of X which x each of the bres setwise is called the group of covering transformations. The following result needs no proof. Proposition 2.3 The group of covering transformations of a connected covering graph acts semiregularly on each of the bres. In particular, if the group of covering transformations is regular on the bres of X = Cov(Y; f), we say that X is a regular cover. In this case, the voltage group Im(f) is a regular group of degree k abstractly isomorphic to the group of covering transformations. The next result is immediate. Proposition 2.4 If X = Cov(Y; f) is a 2-fold cover then it is a regular cover. The proposition below gives a standard result in the theory of covering spaces. We omit its proof. Proposition 2.5 Let Y be a graph, let X = Cov(Y; f) be a regular covering of Y with K as the group of covering transformations, and let 2 Aut Y be such that its lift ~ centralizes K. Then f C = f C any cycle C of Y. The canonical double cover CDC(Y ) of a graph Y is the 2-fold cover Cov(Y; f) where f assigns to each arc in Y the nonidentity element of S 2. The following result will be needed in the proof of Theorem
5 Lemma 2.6 Let m 4 be a positive integer, and let X be a 2-fold cover of Y = K m with girth greater than 3. Then X = CDC(K m ) = K m;m? mk 2. Proof. Firstly, by Proposition 2.4, we have that X is a regular cover with respect to the group Z 2. Without loss of generality we may assume that the spanning tree of Y all of whose edges are assigned voltages 0 is a star K 1;m?1. But the girth of X is at least 4 and so the voltages of all remaining edges of Y equal the generator of the group of covering transformations isomorphic to Z 2. By a relabeling of the vertices belonging to the bre corresponding to the center of the star we easily see that X = CDC(K m ) = K m;m? mk 2. Lemma 2.7 Let Y be a graph with a permutation voltage assignment f. If T is a triangle of Y contained in some K 4 all of whose 4-cycles have identity voltage, then (f T ) 2 = id. Proof. Let T = a; b; c; a and let = f a;b ; = f b;c, and = f c;a. Let x be the fourth vertex of a K 4 satisfying the assumptions of this lemma. Let = f a;x ; = f b;x, and = f c;x. Then the fact that the voltage of each 4-cycle in Y is id implies?1 =?1 =?1 = id. Hence (f T ) 2 = () 2 = id. 3 Proving Theorem 1.2 The following group-theoretic results will play a crucial role in the proof of Theorem 1.2. Proposition 3.1 (Burnside, [12, Theorems 25.3 and 25.6]) A primitive group containing a regular cyclic subgroup of composite order or a regular dihedral subgroup is doubly transitive. Proposition 3.2 ([10, ]) Let H be a subgroup of a group G. Then C G (H) is a normal subgroup of N G (H) and the quotient N G (H)=C G (H) is isomorphic with a subgroup of Aut H. The following result may be deduced from the classication of doubly transitive groups (see [3] or [4, p.243]). 5
6 Proposition 3.3 A 3-transitive but not 4-transitive group may be identied with one of the following groups. (i) M 11 of degree 12; (ii) M 22 of degree 22; (iii) P SL(2; q) G P?L(2; q), where P SL(2; q) is the socle of G, and G acts on P G(1; q) in a natural way, having degree q + 1, with q a prime power. Finally, we have Lemma 3.4 Let G be a nite group and let K be a normal subgroup of G which is either cyclic or isomorphic to Z 2 Z 2 nonabelian simple group. Then C G (K) = G. and such that G=K is a Proof. Clearly, C G (K) K, for K is abelian. Moreover, C G (K) is normal in G and hence C G (K)=K is normal in G=K. But G=K is simple and therefore C G (K)=K = 1 or C G (K)=K = G=K. In the rst case C G (K) = K and so, by Proposition 3.2, we have that G=K = G=C G (K) is isomorphic to a subgroup of Aut K. But this is not possible in view of our assumptions on K. Therefore C G (K) = G. We adopt the following notation. For a permutation group G acting on a set V and a subset W of V we let G W denote the setwise stabilizer of W in G and we let G fw g denote the pointwise stabilizer of W in G. Also, we shall say that a subset B of V is a minimal block for G if it is a block for G containing at least two points, and no other block with at least two points is properly contained in B. Proof of Theorem 1.2. The proof that the transitivities of the graphs C 2n and K 2n in Theorem 1.2 are as claimed, is left to the reader. Let X 6= C 2n ; K 2n, where n 3, be a connected 2-arc-transitive dihedrant. We will show that X is a bipartite graph. The proof is by induction on the order of X. Assume that the statement of the theorem has been proved for all dihedrants of order less than 2n. Let (S; T ) be a symbol of X. We may assume that S 6= ; and so, combining Propositions 2.1 and 2.2, it follows that 6
7 X has girth 4: (1) Next, since X 6= K 2n, Proposition 3.1 implies that A = Aut X is imprimitive. Choose a minimal block of A, say of cardinality k 2, and let B be the corresponding complete system of imprimitivity of A. (Clearly, A B B is primitive for each B 2 B.) Let K denote the kernel of the action of A on B and let A = A=K denote the corresponding quotient group. Moreover, let X denote the quotient graph X=B of X relative to B, that is the graph with vertex set B such that two blocks B and B 0 are adjacent if and only if there is an edge in X with one end-vertex in B and the other end-vertex in B 0. The 2-arc-transitivity of X then implies that X admits a 2-arc-transitive action of A: (2) Moreover, we have that each block in B induces a totally disconnected graph. Now, we may assume that jbj > 2, for otherwise the graph X is bipartite and we are done. Next, the fact that X is 2-arc-transitive, implies that each bipartite graph induced by two adjacent blocks in X, is isomorphic to kk 2. If that was not the case, then letting B 0 ; B 00 be neighbors of B in X we could nd 2-arcs in X of the form v 0 ; v; v 00 and v 0 ; v; u 0, with v 2 B; u 0 ; v 0 2 B 0 ; v 00 2 B 00, obviously not belonging to the same orbit of A. Therefore we have that X = Cov( X; f) is a k-fold cover of a connected 2-arc-transitive graph X. Since X 6= C 2n, the valency val X of X is at least 3, and of course X cannot be a cycle. Besides, if X is bipartite, then X must also be bipartite and we are done. We may therefore assume that X is neither a cycle nor a bipartite graph. (3) Moreover, if val X = 3 then, since S 6= ;, it is easily seen that X must be isomorphic to the cube Q 3 = K4;4? 4K 2, a bipartite graph. Hence we may assume that val X 4 and thus jbj 5: (4) Next, recall that since X is a connected graph, the action of K is semiregular on each block, in view of Proposition 2.3. Furthermore, since the orbits of K form a block system of G, the minimality of blocks in B then implies that K B is either regular or trivial for each B 2 B. In fact, we are going 7
8 to show that K is regular on each block in B; in other words, the group of covering transformations is regular on the bres B 2 B and X is thus a regular cover of X. More precisely, we will prove that two essentially dierent cases may occur with the restriction K B, B 2 B, isomorphic to either Z p, where p is a prime, or to Z 2 2. To see this let D denote a regular dihedral subgroup of A generated by an element of order n and an involution such that =?1. Of course, B is also a block system of D. Choose a block B 2 B and consider the setwise stabilizer D B. In view of (4), the latter is a subgroup of D of index at least 5. Therefore there exists m 2 Z n nf0g such that D B is either h m i or h m i or h m ; i. Suppose rst that D B = h m i. Then X must be a 2-fold cover and as such a regular cover of X by Proposition 2.4. Besides, it is easily seen that B = fb i : i 2 Z n g. Hence A contains a regular cyclic group hi and so X is a circulant, which is 2-arc-transitive by (2), and thus, combining together Proposition 1.1 and (3), we may assume that X is a complete graph, and so X = K n=2, forcing X to be bipartite by Lemma 2.6 and (1). Suppose next that D B = h m i. Then D B is a normal subgroup of D and so it clearly xes every block in B, forcing D B K. Of course, D B is regular on B and, since K is by Proposition 2.3 semiregular on each block, we have that K = D B is regular on each block in B. Besides, since K is a cyclic normal subgroup of A, every subgroup of K is normal in A, and thus its orbits form a block system of A. The minimality of blocks in B then forces k = p, a prime and K = Z p.. Thus X is a regular cover of X with respect to the cyclic group Z p. Moreover, we have that DK=K = D=K = D=D \ K is a regular dihedral subgroup of A and so X is itself a dihedrant, of order 2m, where m = n=p < n. Therefore by induction hypothesis we have that X, as a 2-arc-transitive dihedrant, satises the assumptions of Theorem 1.2. In view of (3) we thus have X = K 2m as the only possibility. Also, in this case we may assume that p is an odd prime in view of Lemma 2.6. Supose now that D B = h m ; i. (In this case D B is not a normal subgroup of D, unless n is even and m generates a subgroup of index 2 in hi.) It is easily seen that B = fb i : i 2 Z m g and thus the subgroup generated by m xes each of the blocks in B, that is id 6= h m i K. Hence K is nontrivial and thus it has to be regular on blocks in B. In particular, K B is a 2-extension of the cyclic group h m i B and thus the minimality of the block B forces jbj = 4, m = n=2 and so K = Z 2 2, for in all other cases the orbits of h m i would form an imprimitivity block system of A. Moreover, we have 8
9 that hi=k \ hi = hi=h m i is a regular cyclic subgroup of A and so X is a circulant, of order n=2. As in the rst case above, combining Proposition 1.1 and (3), we may thus assume that X is a complete graph. More precisely, X = K n=2. To summarize, we are now left with one of the following two situations. Either there exists an odd prime p such that K = Z p and the graph X is a regular p-fold cover of the complete graph K 2m, where m = n=p, with respect to the group Z p, or else K = Z 2 2 and X is a regular cover of K n=2 with respect to the group Z 2 2. Moreover, the quotient X admits a regular dihedral group in the rst case, and a regular cyclic group in the second case. In what follows we shall prove that X is necessarily bipartite in the case K = Z 2 2, and that, on the other hand, no connected cover satisfying the above assumptions exists in the case K = Z p. Fix a block B 2 B. By a relabeling of the vertices of X, if necessary, we may see that X = Cov( X; f), where f assigns voltage id to all the arcs having B as an end-vertex. In other words, we have chosen the spanning tree in X with id voltages to be the star with center in B. For the rest of the proof of Theorem 1.2, we shall now identify X with Cov( X; f). By a voltage of an arc (or a cycle) we shall mean the f-voltage of that arc (or cycle). Combining (2) with the fact that X is a complete graph, we have that A acts 3-transitively on the vertices of X, that is on the set B. If A is at least 4-transitive, then since, by (1), there must be at least one 4-cycle in X with voltage equal to id, it follows that all 4-cycles must have the same property. We can then use Lemma 2.7 to deduce that for all triangles T of X, the voltage f T is an involution. In particular, this implies that the voltage of each arc in X joining two blocks dierent from B is an involution, which immediately excludes the rst case K = Z p, p odd prime. Besides, letting B 0 ; B 00 ; B 000 be any three blocks dierent from B, we must have that f B = f 0 B ;B00 00 ;B 000, since the voltage of the 4-cycle B; B0 ; B 00 ; B 000 ; B is id. This forces all arcs with end-vertices diferent from B to have the same voltage. But then X = 2CDC(K n=2) would be disconnected, and so also the second case K = Z 2 2 leads to a contradiction. We conclude that A is precisely 3-transitive. Therefore A may be identied with one of the groups in Proposition 3.3. Observe that neither M 11 nor M 22 contains a regular subgroup of degrees 12 and 22, respectively, in the above 3-transitive actions. We may therefore identify the group A with a subgroup of P?L(2; q) having P SL(2; q) as a socle, and we may identify the set B with the projective line P G(1; q) = 9
10 GF (q) [ f1g. In particular, 2m = q + 1 and q = r a is a power of a prime r. Let G be the preimage of the subgroup G of A isomorphic with P SL(2; q). We will now analyze the action of G on X in more detail. Using Lemma 3.4 it follows that C G (K) = G when K = Z p as well as when K = Z 2 2. If q is even we have that G is 3-transitive on X, and so all triangles in X have the same voltage, which has to be an involution. But then this involution is the voltage of any arc in X, except for those of the spanning star with center in B (which have voltage id). In particular K = Z 2 2, and moreover X = 2CDC(K n=2 ) is disconnnected, a contradiction. Therefore q is odd and G is not 3-transitive on X. The analysis now depends on whether G contains an element reversing the orientation of a given triangle or not. (It may be seen that such an orientation reversing automorphism exists if and only if q 1 (mod 4) but this information is not really needed here.) If that is the case then, using the same argument as above, we have that the voltage of a triangle in X is an involution, forcing K = Z 2 2, and that, moreover, at most two dierent voltages for these triangles are possible. Hence all of the arcs in X not incident with B attain one of these two voltages This forces X to be bipartite, for every closed walk in X of odd length contains an even number of one and an odd number of the other of these two involutions. We may now assume that G contains no element reversing the orientation of a given triangle. But then G is transitive on 3-subsets in B, that is on unordered triangles in X. If K = Z 2 2 then again X = 2CDC(K n=2 ), a contradiction. Hence K = Z p and so, combining Proposition 2.5 together with (1), we have that there exists w 2 Z p such that for every triangle T of X f T 2 fw; p? wg: (5) Consider the action of the subgroup K G fbg = K GfBg of C G (K) on the subgraph, say Y, of X consisting of all the vertices in B and all the vertices in all the blocks belonging to an orbit of an element 2 G fbg, of order r in its action on B. Label these blocks as B i ; i 2 Z r, with B i+1 = B i. Let be a generator of K. Note that xes each vertex in B and has p orbits of length r in Y, that is precisely all of the neighbors' sets N(u) \ V (Y ), where u 2 B. Fix a vertex v 2 B and label it with the ordered pair (1; 0). Next, label its neighbor in B i, i 2 Z r, with (i; 0). Then let (1; s) = (1; 0) s 10
11 for all s 2 Z p and let (i; s) = (i; 0) s for all i 2 Z r and all s 2 Z p. The automorphisms and then map according to the rules: (s; i) = (s; i + 1) for all i 2 f1g [ Z r and s 2 Z p, and (s; i) = (s + 1; i) for all i 2 Z r and s 2 Z p, and xes each (1; i), i 2 Z r. Let w d = f B0 ;B d for all d 2 Z r. Since =, it follows that f Bi ;B i+d = w d for all i 2 Z r. With no loss of generality assume w 1 = w. If r = 3 then the triangle B 0 ; B 1 ; B 2 ; B 0 has voltage 3w and so by (5) we have 3w 2 fw; p? wg, forcing either 2w = 0 or 4w = 0. But both possibilities contradict the fact that p is an odd prime. Assume that r 5. Now the triangle B 0 ; B 1 ; B 2 ; B 0 has voltage 2w 1? w 2 = 2w? w 2 which must be either w or p? w. In the latter case w 2 = 3w 2 fw; p? wg. Thus either 4w = 0 or 2w = 0, again contradicting p odd. Therefore the rst case occurs and so w 2 = w 1 = w. Now, considering the triangle B 0 ; B 1 ; B 3 ; B 0, we obtain as above that its voltage 2w? w 3 must be equal to w rather than p? w, forcing w 3 = w. Continuing this way we have that w (p?1)=2 = w which forces the triangle B 0 ; B (p?1)=2 ; B (p+1)=2 ; B 0 to have voltage 3w. But then 3w = w or 3w = p? w, and thus again either 2w = 0 or 4w = 0, a contradiction. These contradictions show that X cannot be a p-fold cover of X if p is an odd prime, thus completing the proof of Theorem 1.2. Acknowledgement: The author is grateful to dr. Shao-fei Du for the helpful discussions during the preparation of this paper. References [1] B. Alspach, C. D. E. Conder, D. Marusic, M.-Y. Xu, A classication of 2-arctransitive circulants, J. Alg. Combin. 5 (1996), 83{86. [2] R. W. Baddeley, Two-arc transitive graphs and twisted wreath products, J. Alg. Combin. 2 (1993), 215{237. [3] P.J.Cameron, Finite permutation groups and nite simple groups, Bull. London. Math. Soc., 13 (1981), 1{22. [4] J. D. Dixon, B. Mortimer, \Permutation Groups", Springer-Verlag, New York,
12 [5] X. G. Fang, C. E. Praeger, Finite two-arc-tarnsitive graphs admitting a Suzuki simple group, Research Report, Department of Mathematics, University of Western Australia, (1996). [6] X. G. Fang, C. E. Praeger, Finite two-arc-tarnsitive graphs admitting a Ree simple group, Research Report, Department of Mathematics, University of Western Australia, (1996). [7] B. Huppert, \Endliche Gruppen I", Springer-Verlag, Berlin, [8] D.S. Passman, \Permutation Groups", Benjamin, Menlo Park, California, [9] C. E. Praeger, Finite transitive permutation groups and nite vertextransitive graphs, Symmetry in graphs, NATO Conference, Montreal, July 1997, to appear. [10] D. J. Robinson, \A course in the theory of groups", Springer Verlag, New York, [11] W. T. Tutte, On the symmetry of cubic graphs, (1958), [12] H. Wielandt, \Finite Permutation Groups", Academic Press, New York,
13 ON 2-ARC-TRANSITIVE CAYLEY GRAPHS OF DIHEDRAL GROUPS Keywords: permutation group, imprimitive group, dihedral group, Cayley graph, 2-arc-transitive graph. 13
14 ON 2-ARC-TRANSITIVE CAYLEY GRAPHS OF DIHEDRAL GROUPS Contact address: Dragan Marusic IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija tel fax dragan.marusic@uni-lj.si 14
-ARC-TRANSITIVE GRAPHS Dragan Marusic IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija
CLASSIFYING -ARC-TRANSITIVE GRAPHS OF ORDER A PRODUCT OF TWO PRIMES Dragan Marusic 1 Primoz Potocnik 1 IMFM, Oddelek za matematiko IMFM, Oddelek za matematiko Univerza v Ljubljani Univerza v Ljubljani
More informationContact author address Dragan Marusic 3 IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija Tel.: F
PERMUTATION GROUPS, VERTEX-TRANSITIVE DIGRAPHS AND SEMIREGULAR AUTOMORPHISMS Dragan Marusic 1 Raffaele Scapellato 2 IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 61111 Ljubljana Slovenija
More information1 Introduction We adopt the terminology of [1]. Let D be a digraph, consisting of a set V (D) of vertices and a set E(D) V (D) V (D) of edges. For a n
HIGHLY ARC-TRANSITIVE DIGRAPHS WITH NO HOMOMORPHISM ONTO Z Aleksander Malnic 1 Dragan Marusic 1 IMFM, Oddelek za matematiko IMFM, Oddelek za matematiko Univerza v Ljubljani Univerza v Ljubljani Jadranska
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 informationA TETRAVALENT HALF-ARC-TRANSITIVE GRAPH WITH NONABELIAN VERTEX STABILIZER
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 8 (000), 685 A TETRAVALENT HALF-ARC-TRANSITIVE
More informationON THE POINT STABILIZERS OF TRANSITIVE GROUPS WITH NON-SELF-PAIRED SUBORBITS OF LENGTH 2
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 37 (1999), 644 ON THE POINT STABILIZERS OF
More informationTetravalent Graphs Admitting Half-Transitive Group Actions: Alternating Cycles
Journal of Combinatorial Theory, Series B 75, 18805 (1999) Article ID jctb.1998.1875, available online at http:www.idealibrary.com on Tetravalent Graphs Admitting Half-Transitive Group Actions: Alternating
More informationarxiv: v1 [math.co] 1 Jan 2019
ARC-TRANSITIVE GRAPHS OF VALENCY TWICE A PRIME ADMIT A SEMIREGULAR AUTOMORPHISM MICHAEL GIUDICI AND GABRIEL VERRET arxiv:1901.00084v1 [math.co] 1 Jan 2019 Abstract. We prove that every finite arc-transitive
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 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 informationFINITE GROUPS IN WHICH SOME PROPERTY OF TWO-GENERATOR SUBGROUPS IS TRANSITIVE
FINITE GROUPS IN WHICH SOME PROPERTY OF TWO-GENERATOR SUBGROUPS IS TRANSITIVE COSTANTINO DELIZIA, PRIMOŽ MORAVEC, AND CHIARA NICOTERA Abstract. Finite groups in which a given property of two-generator
More informationQuotients of vertex-transitive graphs
Chapter 5 Quotients of vertex-transitive graphs This chapter will study some operations on vertex-transitive graphs. 5.1 Quotient graphs Let Γ = (V,E) be a digraph. For a partition B of V,thequotient Γ
More informationCLASSIFICATION OF CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 14p 2
Hacettepe Journal of Mathematics and Statistics Volume 41(2) (2012), 277 282 CLASSIFICATION OF CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 14p 2 Mehdi Alaeiyan and Mohsen Lashani Received 11:12:2010 : Accepted
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 informationON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II
Bull. Aust. Math. Soc. 87 (2013), 441 447 doi:10.1017/s0004972712000470 ON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II GABRIEL VERRET (Received 30 April 2012; accepted 11 May 2012; first
More informationArc-transitive pentavalent graphs of order 4pq
Arc-transitive pentavalent graphs of order 4pq Jiangmin Pan Bengong Lou Cuifeng Liu School of Mathematics and Statistics Yunnan University Kunming, Yunnan, 650031, P.R. China Submitted: May 22, 2012; Accepted:
More informationMathematica Slovaca. Dragan Marušič; Tomaž Pisanski The remarkable generalized Petersen graph G(8, 3) Terms of use:
Mathematica Slovaca Dragan Marušič; Tomaž Pisanski The remarkable generalized Petersen graph G(8, 3) Mathematica Slovaca, Vol. 50 (2000), No. 2, 117--121 Persistent URL: http://dml.cz/dmlcz/133137 Terms
More informationSymmetric graphs of order 4p of valency prime
International Symposium on Computers & Informatics (ISCI 015) Symmetric graphs of order 4p of valency prime Wang Xiuyun 1, a 1 School of Mathematic Science University of Jinan, Jinan, Shandong, China a
More informationRank 3 Latin square designs
Rank 3 Latin square designs Alice Devillers Université Libre de Bruxelles Département de Mathématiques - C.P.216 Boulevard du Triomphe B-1050 Brussels, Belgium adevil@ulb.ac.be and J.I. Hall Department
More informationHEPTAVALENT SYMMETRIC GRAPHS OF ORDER 6p
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 2017 (741 750) 741 HEPTAVALENT SYMMETRIC GRAPHS OF ORDER 6p Song-Tao Guo School of Mathematics and Statistics Henan University of Science and Technology
More informationLocally 3-arc-transitive regular covers of complete bipartite graphs
Locally 3-arc-transitive regular covers of complete bipartite graphs Eric Swartz Abstract. In this paper, locally 3-arc-transitive regular covers of complete bipartite graphs are studied, and results are
More informationAutomorphisms of a family of cubic graphs
Automorphisms of a family of cubic graphs Jin-Xin Zhou Mohsen Ghasemi ICM 2012, 11-14 March, Al Ain Abstract A Cayley graph Cay(G, S) on a group G with respect to a Cayley subset S is said to be normal
More informationSemiregular automorphisms of vertex-transitive cubic graphs
Semiregular automorphisms of vertex-transitive cubic graphs Peter Cameron a,1 John Sheehan b Pablo Spiga a a School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1
More informationIsomorphisms and Normality of Cayley Digraphs of A5
Isomorphisms and Normality of Cayley Digraphs of A5 Dachang Guo* Department of Mathematics and Physics Guangdong University of Technology Guangzhou 510643, People's Republic of China Abstract It is proved
More informationPrimitive arcs in P G(2, q)
Primitive arcs in P G(2, q) L. Storme H. Van Maldeghem December 14, 2010 Abstract We show that a complete arc K in the projective plane P G(2, q) admitting a transitive primitive group of projective transformations
More informationOn a kind of restricted edge connectivity of graphs
Discrete Applied Mathematics 117 (2002) 183 193 On a kind of restricted edge connectivity of graphs Jixiang Meng a; ;1, Youhu Ji b a Department of Mathematics, Xinjiang University, Urumqi 830046, Xinjiang,
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 informationPermutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation
Notation Basics of permutation group theory Arc-transitive graphs Primitivity Normal subgroups of primitive groups Permutation Groups John Bamberg, Michael Giudici and Cheryl Praeger Centre for the Mathematics
More information8th PhD Summer School in Discrete Mathematics Vertex-transitive graphs and their local actions II
8th PhD Summer School in Discrete Mathematics Vertex-transitive graphs and their local actions II Gabriel Verret g.verret@auckland.ac.nz The University of Auckland Rogla 3 July 2018 Vertex-stabilisers
More informationOn certain Regular Maps with Automorphism group PSL(2, p) Martin Downs
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 53, 2007 (59 67) On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs Received 18/04/2007 Accepted 03/10/2007 Abstract Let p be any prime
More informationBulletin of the. Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 43 (2017), No. 3, pp. 951 974. Title: Normal edge-transitive Cayley graphs on the nonabelian groups of
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 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 informationPentavalent symmetric graphs of order twice a prime power
Pentavalent symmetric graphs of order twice a prime power Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China yqfeng@bjtu.edu.cn A joint work with Yan-Tao Li, Da-Wei Yang,
More informationCubic vertex-transitive non-cayley graphs of order 8p
Cubic vertex-transitive non-cayley graphs of order 8p Jin-Xin Zhou, Yan-Quan Feng Department of Mathematics, Beijing Jiaotong University, Beijing, China jxzhou@bjtu.edu.cn, yqfeng@bjtu.edu.cn Submitted:
More informationImprimitive symmetric graphs with cyclic blocks
Imprimitive symmetric graphs with cyclic blocks Sanming Zhou Department of Mathematics and Statistics University of Melbourne Joint work with Cai Heng Li and Cheryl E. Praeger December 17, 2008 Outline
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 informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
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 informationPrimitive 2-factorizations of the complete graph
Discrete Mathematics 308 (2008) 175 179 www.elsevier.com/locate/disc Primitive 2-factorizations of the complete graph Giuseppe Mazzuoccolo,1 Dipartimento di Matematica, Università di Modena e Reggio Emilia,
More informationResearch Article Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups
International Scholarly Research Network ISRN Algebra Volume 2011, Article ID 428959, 6 pages doi:10.5402/2011/428959 Research Article Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups Mehdi
More informationSemiregular automorphisms of vertex-transitive graphs
Semiregular automorphisms of vertex-transitive graphs Michael Giudici http://www.maths.uwa.edu.au/ giudici/research.html Semiregular automorphisms A semiregular automorphism of a graph is a nontrivial
More informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More informationFURTHER RESTRICTIONS ON THE STRUCTURE OF FINITE DCI-GROUPS: AN ADDENDUM
FURTHER RESTRICTIONS ON THE STRUCTURE OF FINITE DCI-GROUPS: AN ADDENDUM EDWARD DOBSON, JOY MORRIS, AND PABLO SPIGA Abstract. A finite group R is a DCI-group if, whenever S and T are subsets of R with the
More informationarxiv: v3 [math.co] 4 Apr 2011
Also available on http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA x xxxx) 1 x Hamiltonian cycles in Cayley graphs whose order has few prime factors arxiv:1009.5795v3 [math.co] 4 Apr 2011 K. Kutnar University
More informationGeneralised quadrangles with a group of automorphisms acting primitively on points and lines
Generalised quadrangles with a group of automorphisms acting primitively on points and lines John Bamberg a, Michael Giudici a, Joy Morris b, Gordon F. Royle a, Pablo Spiga a a The Centre for the Mathematics
More informationarxiv: v1 [math.co] 19 Nov 2016
Tetravalent 2-transitive Cayley graphs of finite simple groups and their automorphism groups Xin Gui Fang a, Jie Wang a and Sanming Zhou b arxiv:1611.06308v1 [math.co] 19 Nov 2016 a LAMA and School of
More informationTwo-arc-transitive two-valent digraphs of certain orders
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (2016) 127 146 Two-arc-transitive two-valent digraphs of certain
More informationSymmetric bowtie decompositions of the complete graph
Symmetric bowtie decompositions of the complete graph Simona Bonvicini Dipartimento di Scienze e Metodi dell Ingegneria Via Amendola, Pad. Morselli, 4100 Reggio Emilia, Italy simona.bonvicini@unimore.it
More information4-valent graphs of order 6p 2 admitting a group of automorphisms acting regularly on arcs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.) ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 9 (2015) 1 18 4-valent graphs of order 6p 2 admitting a group of automorphisms
More informationFinite groups determined by an inequality of the orders of their elements
Publ. Math. Debrecen 80/3-4 (2012), 457 463 DOI: 10.5486/PMD.2012.5168 Finite groups determined by an inequality of the orders of their elements By MARIUS TĂRNĂUCEANU (Iaşi) Abstract. In this note we introduce
More informationOn the point-stabiliser in a transitive permutation group
On the point-stabiliser in a transitive permutation group Primož Potočnik 1 Department of Mathematics University of Auckland Private Bag 92019 Auckland, New Zealand E-mail: potocnik@math.auckland.ac.nz
More informationSelected Topics in AGT Lecture 4 Introduction to Schur Rings
Selected Topics in AGT Lecture 4 Introduction to Schur Rings Mikhail Klin (BGU and UMB) September 14 18, 2015 M. Klin Selected topics in AGT September 2015 1 / 75 1 Schur rings as a particular case of
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationA note on cyclic semiregular subgroups of some 2-transitive permutation groups
arxiv:0808.4109v1 [math.gr] 29 Aug 2008 A note on cyclic semiregular subgroups of some 2-transitive permutation groups M. Giulietti and G. Korchmáros Abstract We determine the semi-regular subgroups of
More informationarxiv: v1 [math.co] 28 Dec 2018
ON EDGE-PRIMITIVE AND -ARC-TRANSITIVE GRAPHS ZAI PING LU arxiv:181.10880v1 [math.co] 8 Dec 018 Abstract. A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short
More informationImprimitive Symmetric Graphs
Imprimitive Symmetric Graphs Sanming Zhou This thesis is presented for the Degree of Doctor of Philosophy of The University of Western Australia Department of Mathematics and Statistics The University
More informationCharacters and triangle generation of the simple Mathieu group M 11
SEMESTER PROJECT Characters and triangle generation of the simple Mathieu group M 11 Under the supervision of Prof. Donna Testerman Dr. Claude Marion Student: Mikaël Cavallin September 11, 2010 Contents
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationTRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS
Journal of Algebra and Related Topics Vol. 2, No 2, (2014), pp 1-9 TRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS A. GHARIBKHAJEH AND H. DOOSTIE Abstract. The triple factorization
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 informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationBlock-Transitive 4 (v, k, 4) Designs and Suzuki Groups
International Journal of Algebra, Vol. 10, 2016, no. 1, 27-32 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.51277 Block-Transitive 4 (v, k, 4) Designs and Suzuki Groups Shaojun Dai Department
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationTetravalent edge-transitive graphs of girth at most 4
Journal of Combinatorial Theory, Series B 97 (2007) 217 236 www.elsevier.com/locate/jctb Tetravalent edge-transitive graphs of girth at most 4 Primož Potočnik a,1,2, Steve Wilson b a University of Auckland,
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 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 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 informationAUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY
AUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY Abstract. We characterize the automorphism groups of circulant digraphs whose connection sets are relatively small, and of
More informationAnalogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph
Analogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph M. Lemańska a, J. A. Rodríguez-Velázquez b, Rolando Trujillo-Rasua c, a Department of Technical
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationAutomorphism groups of circulant graphs a survey
Automorphism groups of circulant graphs a survey Joy Morris Abstract. A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the
More informationChordal Coxeter Groups
arxiv:math/0607301v1 [math.gr] 12 Jul 2006 Chordal Coxeter Groups John Ratcliffe and Steven Tschantz Mathematics Department, Vanderbilt University, Nashville TN 37240, USA Abstract: A solution of the isomorphism
More informationOn the single-orbit conjecture for uncoverings-by-bases
On the single-orbit conjecture for uncoverings-by-bases Robert F. Bailey School of Mathematics and Statistics Carleton University 1125 Colonel By Drive Ottawa, Ontario K1S 5B6 Canada Peter J. Cameron School
More informationHalf-arc-transitive graphs of arbitrary even valency greater than 2
arxiv:150502299v1 [mathco] 9 May 2015 Half-arc-transitive graphs of arbitrary even valency greater than 2 Marston DE Conder Department of Mathematics, University of Auckland, Private Bag 92019, Auckland
More informationCAYLEY NUMBERS WITH ARBITRARILY MANY DISTINCT PRIME FACTORS arxiv: v1 [math.co] 17 Sep 2015
CAYLEY NUMBERS WITH ARBITRARILY MANY DISTINCT PRIME FACTORS arxiv:1509.05221v1 [math.co] 17 Sep 2015 TED DOBSON AND PABLO SPIGA Abstract. A positive integer n is a Cayley number if every vertex-transitive
More informationSimple 3-(q + 1, 5, 3) designs admitting an automorphism group PSL(2, q) with q 1 (mod 4)
Simple -(q + 5 ) designs admitting an automorphism group PSL( q) with q (mod 4) Weixia Li School of Mathematical Sciences Qingdao University Qingdao 667 China Dameng Deng Department of Mathematics Shanghai
More informationPERMUTABILITY GRAPH OF CYCLIC SUBGROUPS
Palestine Journal of Mathematics Vol. 5(2) (2016), 228 239 Palestine Polytechnic University-PPU 2016 PERMUTABILITY GRAPH OF CYCLIC SUBGROUPS R. Rajkumar and P. Devi Communicated by Ayman Badawi MSC 2010
More informationA characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q)
A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q) Joris De Kaey and Hendrik Van Maldeghem Ghent University, Department of Pure Mathematics and Computer
More informationk-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
More informationUniform Star-factors of Graphs with Girth Three
Uniform Star-factors of Graphs with Girth Three Yunjian Wu 1 and Qinglin Yu 1,2 1 Center for Combinatorics, LPMC Nankai University, Tianjin, 300071, China 2 Department of Mathematics and Statistics Thompson
More informationRecognising nilpotent groups
Recognising nilpotent groups A. R. Camina and R. D. Camina School of Mathematics, University of East Anglia, Norwich, NR4 7TJ, UK; a.camina@uea.ac.uk Fitzwilliam College, Cambridge, CB3 0DG, UK; R.D.Camina@dpmms.cam.ac.uk
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationLine graphs and geodesic transitivity
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 6 (2013) 13 20 Line graphs and geodesic transitivity Alice Devillers,
More informationSymmetry properties of generalized graph truncations
Symmetry properties of generalized graph truncations University of Ljubljana and University of Primorska, Slovenia Graphs, groups and more Koper, Slovenia June 1, 2018 Joint work with Eduard Eiben and
More informationArc-transitive Bicirculants
1 / 27 Arc-transitive Bicirculants Klavdija Kutnar University of Primorska, Slovenia This is a joint work with Iva Antončič, Aubin Arroyo, Isabel Hubard, Ademir Hujdurović, Eugenia O Reilly and Primož
More informationRegular embeddings of graphs into surfaces
Banská Bystrica Wien, November 28 November 2, 28 Maps and graph embeddings Maps Map is a 2-cell decomposition of a surface Category OrMaps Maps on orientable surfaces together with orientation-preserving
More informationConnectivity of Intersection Graphs of Finite Groups
Connectivity of Intersection Graphs of Finite Groups Selçuk Kayacan arxiv:1512.00361v2 [math.gr] 2 Aug 2016 Department of Mathematics, Istanbul Technical University, 34469 Maslak, Istanbul, Turkey. e-mail:
More informationarxiv:math/ v1 [math.gr] 15 Apr 2003
ICM 2002 Vol. III 1 3 arxiv:math/0304207v1 [math.gr] 15 Apr 2003 Permutation Groups and Normal Subgroups Cheryl E. Praeger Abstract Various descending chains of subgroups of a finite permutation group
More informationCONSEQUENCES OF THE SYLOW THEOREMS
CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.
More informationArithmetic Progressions with Constant Weight
Arithmetic Progressions with Constant Weight Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel e-mail: raphy@oranim.macam98.ac.il Abstract Let k n be two positive
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationCompatible Circuit Decompositions of Eulerian Graphs
Compatible Circuit Decompositions of Eulerian Graphs Herbert Fleischner, François Genest and Bill Jackson Septemeber 5, 2006 1 Introduction Let G = (V, E) be an Eulerian graph. Given a bipartition (X,
More informationFinite Groups with ss-embedded Subgroups
International Journal of Algebra, Vol. 11, 2017, no. 2, 93-101 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.7311 Finite Groups with ss-embedded Subgroups Xinjian Zhang School of Mathematical
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More information