No Hexavalent Half-Arc-Transitive Graphs of Order Twice a Prime Square Exist

Total Page:16

File Type:pdf, Size:1020Kb

No Hexavalent Half-Arc-Transitive Graphs of Order Twice a Prime Square Exist Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:3 https://doi.org/10.1007/s12044-018-0385-4 No hexavalent half-arc-transitive graphs of order twice a prime square exist MI-MI ZHANG Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China E-mail: [email protected] MS received 30 September 2016; revised 1 October 2017; accepted 3 November 2017; published online 19 March 2018 Abstract. Agraphishalf-arc-transitive if its automorphism group acts transitively on its vertex set and edge set, but not arc set. Let p be a prime. Wang and Feng (Discrete Math. 310 (2010) 1721–1724) proved that there exists no tetravalent half-arc-transitive graphs of order 2p2. In this paper, we extend this result to prove that no hexavalent half-arc-transitive graphs of order 2p2 exist. Keywords. Half-arc-transitive; bi-Cayley graph; vertex transitive; edge transitive. 2010 Mathematics Subject Classification. 05C25, 20B25. 1. Introduction All groups considered in this paper are finite, and all graphs are finite, connected, simple and undirected. For group-theoretic and graph-theoretic terminologies not defined here, we refer the reader to [4,24]. For a graph ,letV (), E(), A() and Aut () be the vertex set, the edge set, the arc set and the full automorphism group of , respectively. A graph is said to be vertex- transitive, edge-transitive or arc-transitive if Aut () acts transitively on V (), E() or A(), respectively. A graph is said to be half-arc-transitive provided that it is vertex- and edge-transitive, but not arc-transitive. The investigation of half-arc-transitive graphs was initiated by Tutte [20] who proved that a vertex- and edge-transitive graph with odd valency must be arc-transitive. In 1970, Bouwer [2] constructed an infinite family of half-arc-transitive graphs, and proved the existence of half-arc-transitive graphs of every even valency at least 4. After Bouwer’s work, many infinite families of half-arc-transitive graphs have been constructed (see, for example, [11,16–18,21]). In 1981, Holt [15] found a half-arc-transitive graph with 27 vertices and valency 4. Alspach et al. [1] proved that Holt’s graph is the smallest half-arc- transitive graph. In the literature, tetravalent half-arc-transitive graphs have also received a lot of attention (see [7,19]), and much work focuses on the classification problem. Let p beaprime.Xu[25] classified the tetravalent half-arc-transitive graphs of order p3 and Feng et al. [13] classified the tetravalent half-arc-transitive graphs of order p4.Itisknown that no half-arc-transitive graphs of order p or p2 exist (see [1]). In [8], Cheng and Oxley © Indian Academy of Sciences 1 3 Page 2 of 8 Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:3 proved that there exist no half-arc-transitive graphs of order 2p.In[23], Wang and Feng proved that no tetravalent half-arc-transitive graphs of order 2p2 exist. In this paper, we shall extend this result to the hexavalent half-arc-transitive graphs of order 2p2. The following is the main result of this paper. Theorem 1.1. No hexavalent half-arc-transitive graphs of order twice a prime square exist. 2. Preliminaries For a finite, simple and undirected graph and a subset B of V (), the subgraph of induced by B will be denoted by [B]. Let be a connected vertex-transitive graph, and let G ≤ Aut () be vertex-transitive on .ForaG-invariant partition B of V (),thequotient graph B is defined as the graph with vertex set B such that for any two vertices B, C ∈ B, B is adjacent to C if and only if there exist u ∈ B and v ∈ C which are adjacent in .LetN be a normal subgroup of G. Then the set B of orbits of N in V () is a G-invariant partition of V (). In this case, the symbol B will be replaced by N . Z Z∗ For a positive integer n,let n denote the cyclic group of order n and n be the mul- tiplicative group of Zn consisting of numbers coprime to n. For two groups M and N, N M denotes a semidirect product of N by M. For a subgroup H of a group G, denote by CG (H) the centralizer of H in G and by NG (H) the normalizer of H of G. Let G be a permutation group on a set and α ∈ . Denoted by Gα the stabilizer of α in G, that is, the subgroup of G fixing the point α. We say that G is semiregular on if Gα = 1 for every α ∈ and regular if G is transitive and semiregular. It is well-known that a graph is a Cayley graph if it has a group of automorphisms acting regularly on V (). If we, instead, require the graph to have a group of automorphisms acting semiregularly on V () with two orbits, then we obtain a so-called bi-Cayley graph. The following proposition is easy to obtain (see, for example, [23, Proposition 1.2]). PROPOSITION 2.1 Every edge-transitive Cayley graph over an abelian group is also arc-transitive. Note that every bi-Cayley graph admits the following concrete realization. Given a group H,letR, L and S be subsets of H such that R−1 = R, L−1 = L and R ∪ L does not contain the identity element of H.Thebi-Cayley graph over H relative to the triple (R, L, S), denoted by BiCay(H, R, L, S) is the graph having vertex set the union of the right part H0 ={h0 | h ∈ H} and the left part H1 ={h1 | h ∈ H}, and edge set the union −1 −1 of the right edges {{h0, g0}|gh ∈ R}, the left edges {{h1, g1}|gh ∈ L} and the −1 spokes {{h0, g1}|gh ∈ S}.If|R|=|L|=s, then BiCay(H, R, L, S)issaidtobe an s-type bi-Cayley graph (see [27]). Let = BiCay(H, R, L, S).Forg ∈ H, define a permutation R(g) on the vertices of by the rule R(g) = ( ) , ∀ ∈ Z , ∈ . hi hg i i 2 h H Then R(H) ={R(h) | h ∈ H} is a semiregular subgroup of Aut () which is isomorphic to H and has H0 and H1 as its orbits. When R(H) is normal in Aut (), the bi-Cayley graph Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:3 Page 3 of 8 3 = BiCay(H, R, L, S) will be called a normal bi-Cayley graph over H (see [28]). A bi-Cayley graph over an abelian group is simply called a bi-abelian. The following proposition is about half-arc-transitive bi-abelians. PROPOSITION 2.2 [9, Proposition 1.3] Every connected regular edge transitive bi-Cayley graph = BiCay(H, R, L, S) over an abelian group is vertex-transitive. Moreover, if is half-arc-transitive, then R ∪ Lis non-empty and does not contain involutions |R|=|L| is even, |S| > 2, and the valency of is at least 6. In view of [22], we have the following proposition. PROPOSITION 2.3 [22, Proposition 2.6] Let X be a connected half-arc-transitive graphs of valency 2n. Let A = Aut (X) and let Au be the stabilizer of u ∈ V (X) in A. Then each prime divisor of |Au| is a divisor of n!. In particular, if X has valency 6 then Au is a {2, 3}-group. By Theorems 1 and 3 of [5], we have the following proposition. PROPOSITION 2.4 [5] Let be a arc-transitive graph of order p and valency n with p a prime and 0 < n < p. Then n is even and divides p − 1 and |Aut ()|=np. Let p be a prime. The following two propositions are all cubic arc-transitive graphs of order 2p and 4p, respectively. PROPOSITION 2.5 [12, Proposition 2.8] Let p be a prime and let be a connected cubic arc-transitive graph of order 2p. Then is 1-,2-,3-or4-regular. Furthermore, −1 (1) is 1-regular if and only if is isomorphic to the graph Cay (D2p, {a, ab, ab }), p 2 where D2p =a, b | a = b = 1, bab = 1, p ≥ 13 and p − 1 is a multiple of 3.In −λ this case, the Cayley graph Cay (D2p, {a, ab, ab }) is normal and it is independent λ Z∗ of the choice of an element of order 3 in p. (2) is 2-regular if and only if is isomorphic to the complete graph K4 of order 4. (3) is 3-regular if and only if is isomorphic to the complete bipartite graph K3,3 of order 6 or the Petersen graph O3 of order 10. (4) is 4-regular if and only if is isomorphic to the Heawood graph of order 14. PROPOSITION 2.6 [26, Theorem 1.3] Let be a connected cubic arc-transitive graph of order 4p, p a prime. Then is one of the following: Q3, the 3-dimensional cube; D20, the dodecahedron; C28, the Coxeter graph; and G P(10, 3), the generalized Peterson graph, which is also the standard double cover of Petersen graph. 3 Page 4 of 8 Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:3 3. Proof of Theorem 1.1 Suppose to the contrary, is a hexavalent half-arc-transitive graph of order 2p2 for a prime p. As the smallest half-arc-transitive graph has order 27, we can assume that p ≥ 5. Let A = Aut () and let P be a Sylow p-subgroup of A.
Recommended publications
  • Group Actions on Graphs, Maps and Surfaces
    Ministry of Education of Slovak Republic Scienti¯c Board of P. J. Saf¶arikUniversity· Doc. RNDr. Roman Nedela, CSc. Group Actions on Graphs, Maps and Surfaces Dissertation for the Degree of Doctor of Physical-Mathematical Sciences Branch: 11-11-9 Discrete Mathematics Ko·sice,May 2005 Contents 1 Introduction 5 2 Half-arc-transitive actions of groups on graphs of valency four 7 2.1 Graphs and groups of automorphisms . 7 2.2 Half-arc-transitive action, G-orientation. 7 2.3 Orbital graphs . 9 2.4 A construction of half-arc-transitive graphs of valency 4 . 10 2.5 Alternating cycles, classi¯cation of tightly attached graphs . 10 2.6 Regular maps and half-arc-transitive graphs of valency four . 11 2.7 P l and Al operators on graphs of valency 4 . 13 2.8 Graphs of valency 4 and girth 4 . 14 2.9 Classi¯cation of point stabilizers . 15 2.10 Relations to group actions of other sorts . 17 3 Maps, Regular Maps and Hypermaps 21 3.1 Topological and combinatorial maps, permutation representation of maps . 21 3.2 Generalization to hypermaps, Walsh map of a hypermap . 28 3.3 Maps, hypermaps and groups . 30 3.4 Regular maps of large planar width and residual ¯niteness of triangle groups . 37 3.5 Maps, hypermaps and Riemann surfaces . 40 3.6 Enumeration of maps of given genus . 43 3.7 Regular hypermaps on a ¯xed surface . 48 3.8 Operations on maps and hypermaps, external symmetries of hy- permaps . 51 3.9 Lifting automorphisms of maps . 54 3.10 Regular embeddings of graphs .
    [Show full text]
  • Recent Trends and Future Directions in Vertex-Transitive Graphs
    Also available at http://amc.imfm.si ISSN 1855-3966 (printed ed.), ISSN 1855-3974 (electronic ed.) ARS MATHEMATICA CONTEMPORANEA 1 (2008) 112–125 Recent Trends and Future Directions in Vertex-Transitive Graphs Klavdija Kutnar ∗ University of Primorska, FAMNIT, Glagoljaskaˇ 8, 6000 Koper, Slovenia Dragan Marusiˇ cˇ ∗ University of Primorska, FAMNIT, Glagoljaskaˇ 8, 6000 Koper, Slovenia University of Ljubljana, PEF, Kardeljeva plosˇcadˇ 16, 1000 Ljubljana, Slovenia Received 3 August 2008, accepted 19 August 2008, published online 22 August 2008 Abstract A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular au- tomorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade. Keywords: Vertex-transitive graph, arc-transitive graph, half-arc-transitive graph, Hamilton cycle, Hamilton path, semiregular group, (im)primitive group. Math. Subj. Class.: 05C25, 20B25 1 In the beginning Vertex-transitive graphs, that is, graphs whose automorphisms groups acts transitively on the corresponding vertex sets, have been an active topic of research for a long time now. Much of this interest is due to their suitability to model scientific phenomena when symmetry is an issue. It is the aim of this article to discuss recent developments surrounding two well known open problems in vertex-transitive graphs – the Hamilton path/cycle problem and the semiregularity problem – as well as the general question addressing structural properties of arc-transitive and half-arc-transitive graphs.
    [Show full text]
  • Constructing Graphs Which Are 1/2-Transitive
    /. Austral. Math. Soc. (Series A) 56 (1994), 391-402 CONSTRUCTING GRAPHS WHICH ARE 1/2-TRANSITIVE BRIAN ALSPACH, DRAGAN M ARUSIC and LEWIS NOWITZ (Received 26 July 1991; revised 5 February 1992) Communicated by L. Caccetta Abstract An infinite family of vertex- and edge-transitive, but not arc-transitive, graphs of degree 4 is constructed. 1991 Mathematics subject classification (Amer. Math. Soc): 05 C 25. 1. Introduction If G is a graph, then the arcs of G are obtained by taking one arc for each orientation of each edge of G so that there are twice as many arcs as edges. A k-arc of G is a directed walk of length k using the arcs of G except that one cannot follow an arc (u, v) by the arc (v, u) in the directed walk. A k-path P of G with end vertices u and v is a walk (undirected) of length k such that each of u and v is incident with one edge of P, and all other vertices of P are incident with two edges of P. A graph G is said to be vertex-transitive, edge-transitive and arc-transitive provided its automorphism group Aut(G) acts transitively on the vertices, edges and arcs of G, respectively. (The terms symmetric and l-transitive also have been used instead of arc-transitive.) In general, a graph is said to be k-arc-transitive if Aut(G) acts transitively on the £-arcs of G. Biggs [3] defines a graph G to be k-transitive if Aut(G) acts transitively on the )t-arcs of G, but does not act transitively on the (k + l)-arcs.
    [Show full text]
  • Primitive Permutation Groups with Soluble Stabilizers and Applications to Graphs
    Primitive Permutation Groups with Soluble Stabilizers and Applications to Graphs Hua Zhang School of Mathematics and Statistics A thesis submitted for the degree of Doctor of Philosophy of the University of Western Australia February 2011 September 13, 2011 Dedicated to my parents ii Statement The results in this thesis are my own except where otherwise stated. iii Acknowledgements First and foremost, I would like to express my sincere gratitude to my supervi- sor, Professor Cai Heng Li, both for his constant and patient assistance and advice throughout the preparation of the thesis, for his continuous encouragement, and for all his kindly help and emotional support during my stay here in Australia. I would like to express my sincere gratitude to my supervisor, Winthrop Pro- fessor Cheryl E. Praeger. As one of the most influential mathematician in the world, she has led the research direction of many of her Ph.D students, and each of them benefits from her rich experience and vast knowledge. Her friendliness and long-term support will be most appreciated. It is a tremendous fortune to do my Ph.D under the supervision of the two leading mathematicians. I gratefully acknowledge the financial support of the Scholarships for Interna- tional Research Fees (SIRF) from the University of Western Australia. I am deeply indebted to my wife Yan Cao and my son Yucheng Zhang for their understanding, unlimited love and support. I am very grateful to Dr Jian Ping Wu, for her long-term friendship, so much help and spiritual support. I would like to thank Associated Professor Michael Giudici and Associated Pro- fessor John Bamberg for their friendship, constructive suggestions for the thesis, and the assistance of computation.
    [Show full text]
  • Topics in Graph Automorphisms and Reconstruction (2Nd Edition), J
    LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES Managing Editor: Professor M. Reid, Mathematics Institute, University of Warwick, Coventry CV4 7AL, United Kingdom The titles below are available from booksellers, or from Cambridge University Press at http://www.cambridge.org/mathematics 312 Foundations of computational mathematics, Minneapolis 2002, F. CUCKER et al. (eds) 313 Transcendental aspects of algebraic cycles, S. MULLER-STACH¨ & C. PETERS (eds) 314 Spectral generalizations of line graphs, D. CVETKOVIC,´ P. ROWLINSON & S. SIMIC´ 315 Structured ring spectra, A. BAKER & B. RICHTER (eds) 316 Linear logic in computer science, T. EHRHARD, P. RUET, J.-Y. GIRARD & P. SCOTT (eds) 317 Advances in elliptic curve cryptography, I.F. BLAKE, G. SEROUSSI & N.P. SMART (eds) 318 Perturbation of the boundary in boundary-value problems of partial differential equations, D. HENRY 319 Double affine Hecke algebras, I. CHEREDNIK 320 L-functions and Galois representations, D. BURNS, K. BUZZARD & J. NEKOVA´ R(eds)ˇ 321 Surveys in modern mathematics, V. PRASOLOV & Y. ILYASHENKO (eds) 322 Recent perspectives in random matrix theory and number theory, F. MEZZADRI & N.C. SNAITH (eds) 323 Poisson geometry, deformation quantisation and group representations, S. GUTT et al (eds) 324 Singularities and computer algebra, C. LOSSEN & G. PFISTER (eds) 325 Lectures on the Ricci flow, P. TOPPING 326 Modular representations of finite groups of Lie type, J.E. HUMPHREYS 327 Surveys in combinatorics 2005, B.S. WEBB (ed) 328 Fundamentals of hyperbolic manifolds, R. CANARY, D. EPSTEIN & A. MARDEN (eds) 329 Spaces of Kleinian groups, Y. MINSKY, M. SAKUMA & C. SERIES (eds) 330 Noncommutative localization in algebra and topology, A.
    [Show full text]
  • Vertex-Transitive Graphs and Their Arc-Types Arxiv:1505.02029V1 [Math.CO] 8 May 2015
    Vertex-transitive graphs and their arc-types Marston Conder, TomaˇzPisanski, and Arjana Zitnikˇ 6 May 2015 Abstract Let X be a finite vertex-transitive graph of valency d, and let A be the full automorphism group of X. Then the arc-type of X is defined in terms of the sizes of the orbits of the action of the stabiliser Av of a given vertex v on the set of arcs incident with v. Specifically, the arc-type is the partition of d as the sum n1 +n2 +···+nt +(m1 +m1)+(m2 +m2)+···+(ms +ms), where n1; n2; : : : ; nt are the sizes of the self-paired orbits, and m1; m1; m2; m2; : : : ; ms; ms are the sizes of the non-self-paired orbits, in descending order. In this paper, we find the arc-types of several families of graphs. Also we show that the arc-type of a Cartesian product of two `relatively prime' graphs is the natural sum of their arc-types. Then using these observations, we show that with the exception of 1 + 1 and (1 + 1), every partition as defined above is realisable, in the sense that there exists at least one graph with the given partition as its arc-type. Keywords: symmetry type, vertex-transitive graph, arc-transitive graph, Cay- ley graph, Cartesian product, covering graph. Mathematics Subject Classification (2010): 05E18, 20B25, 05C75, 05C76. 1 Introduction Vertex-transitive graphs hold a significant place in mathematics, dating back to the time of first recognition of the Platonic solids, and also now in other disciplines where symmetry (and even other properties such as rigidity) play an important role, such as fullerene chemistry, and interconnection networks.
    [Show full text]
  • Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity
    Faculty of Mathematics Professorship for Algorithmic and Discrete Mathematics Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity Dissertation submitted to the Faculty of Mathematics at Technische Universität Chemnitz in accordance with the requirements for the degree doctor rerum naturalium (Dr. rer. nat.) by M.Sc. Martin Winter Chemnitz, June 26, 2021 Referees: Prof. Dr. Christoph Helmberg (supervisor) Prof. Dr. Michael Joswig Prof. Dr. Egon Schulte submitted April 8, 2021 defended June 18, 2021 https://nbn-resolving.org/urn:nbn:de:bsz:ch1-qucosa2-752155 Winter, Martin Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity Dissertation, Faculty of Mathematics Technische Universität Chemnitz, 2021 Bibliographical description Martin Winter Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity Dissertation, 188 pages, Technische Universität Chemnitz, Faculty of Mathematics, 2021 Abstract A spectral graph realization is an embedding of a finite simple graph into Euclidean space that is constructed from the eigenvalues and eigenvectors of the graph’s adjacency matrix. It has previously been observed that some polytopes can be reconstructed from their edge-graphs by taking the convex hull of a spectral realization of this edge-graph. These polytopes, which we shall call spectral polytopes, have remarkable rigidity and symmetry properties and are a source for many open questions. In this thesis we aim to further the understanding of this phenomenon by exploring the geometric and combinatorial properties of spectral polytopes on several levels. One of our central questions is whether already “weak” forms of symmetry can be a sufficient reason for a polytope to be spectral. To answer this, we derive a geometric criterion for the identifica- tion of spectral polytopes and apply it to prove that indeed all polytopes of combined vertex- and edge-transitivity are spectral, admit a unique reconstruction from the edge-graph and realize all the symmetries of this edge-graph.
    [Show full text]
  • Arxiv:2102.07183V2 [Math.GR] 25 Feb 2021
    THE TRANSITIVE GROUPS OF DEGREE 48 AND SOME APPLICATIONS DEREK HOLT, GORDON ROYLE, AND GARETH TRACEY Abstract. The primary purpose of this paper is to report on the successful enumeration in Magma of representatives of the 195 826 352 conjugacy classes of transitive subgroups of the symmetric group S48 of degree 48. In addition, we have determined that 25707 of these groups are minimal transitive and that 713 of them are elusive. The minimal transitive examples have been used to enumerate the vertex-transitive graphs of degree 48, of which there are 1 538 868 366, all but 0.1625% of which arise as Cayley graphs. We have also found that the largest number of elements required to generate any of these groups is 10, and we have used this fact to improve previous general bounds of the third author on the number of elements required to generate an arbitrary transitive permutation group of a given degree. The details of the proof of this improved bound will be published by the third author as a separate paper. 1. Introduction Since late in the 19th century, significant effort has been devoted to compiling catalogues and databases of various types of groups, including complete lists of (representatives of the conjugacy classes of) the transitive and primitive subgroups of the symmetric groups of small degree. For the transitive groups, earlier references include [24, 23] (with corrections in [25]) for degrees up to 12, [12] for degrees up to 31, [2] for the significantly more difficult case of degree 32, and [11] for degrees 33 47.
    [Show full text]
  • Examples of Computer Experimentation in Algebraic Combinatorics
    Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 237–258 Examples of computer experimentation in algebraic combinatorics Mikhail Klin Department of Mathematics, Ben-Gurion University of the Negev, Beer Sheva, Israel Christian Pech ∗ Loßnitzgrundstraße¨ 47, 01445 Radebeul, Germany Sven Reichard y Via Scatale 640, 23852 Carlate (LC), Italy Andrew Woldar Department of Mathematical Sciences, Villanova University, Villanova, PA 19085 USA Matan Ziv-Av Department of Mathematics, Ben-Gurion University of the Negev, Beer Sheva, Israel Received 29 September 2009, accepted 27 November 2010, published online 29 December 2010 Abstract We introduce certain paradigms for procuring computer-free explanations from data acquired via computer algebra experimentation. Our established context is the field of algebraic combinatorics, with special focus on coherent configurations and association schemes. All results presented here were obtained by the authors with the aid of com- puter algebra systems, especially COCO and GAP. A number of examples are explored, in particular of objects on 28, 50, 63, and 210 points. In a few cases, initial experimental data pointed to appropriate theoretical generalizations that yielded an infinite class of re- lated combinatorial structures. Special attention is paid to algebraic automorphisms (of a coherent algebra), a fairly new concept that has already proved to have far-reaching conse- quences. Finally, we focus on the Doyle-Holt graph on 27 vertices, and some of its related structures. ∗Supported by the Skirball postdoctoral fellowship of the Center of Advanced Studies in Mathematics at the Mathematics Department of Ben-Gurion University.
    [Show full text]
  • Links Between Two Semisymmetric Graphs on 112 Vertices Through the Lens of Association Schemes
    Links between two semisymmetric graphs on 112 vertices through the lens of association schemes Mikhail Klin1, Josef Lauri2, Matan Ziv-Av1 April 20, 2011 1 Introduction One of the most striking impacts between geometry, combinatorics and graph theory, on one hand, and algebra and group theory, on the other hand, arise from a concrete necessity to manipulate with the symmetry of the investigated objects. In the case of graphs, we talk about such tasks as identification and compact representation of graphs, recognition of isomorphic graphs and com- putation of automorphism groups of graphs. Different classes of interesting graphs are defined in terms of the level of their symmetry, which which is founded on the concept of transitivity. A semisym- metric graph, the central subject in this paper, is a regular graph Γ such that its automorphism group Aut(Γ) acts transitively on the edge set E(Γ), though intransitively on the vertex set V (Γ). More specifically, we investigate links between two semisymmetric graphs, both on 112 vertices, the graph N of valency 15 and the graph L of valency 3. While the graph N can be easily defined and investigated without serious computations, the manipulation with L inherently depends on a quite heavy use of a computer. The graph L, commonly called the Ljubljana graph, see [76], has quite a striking history, due to efforts of a few generations of mathematicians starting from M. C. Gray and I. Z. Bouwer and ending with M. Conder, T. Pisanski and their colleagues; the order of its automorphism group is 168. The graph L turns out to be a spanning subgraph of the graph N , which has the group S8 of order 8! as automorphism group.
    [Show full text]
  • A Family of Tetravalent Half-Transitive Graphs
    A Family of Tetravalent Half-transitive Graphs Sucharita Biswas1, Angsuman Das1,∗ Department of Mathematics, Presidency University, Kolkata, India Abstract In this paper, we introduce a new family of graphs, Γ(n, a). We show that it is an infinite family of tetravalent half-transitive Cayley graphs. Apart from that, we determine some structural properties of Γ(n, a). Keywords: half-transitive graph, graph automorphism, cycles 2008 MSC: 05C25, 20B25, 05E18 1. Introduction A graph G =(V, E) is said to be vertex-transitive, edge-transitive and arc-transitive if the automorphism group of G, Aut(G), acts transitively on the vertices, on the edges and on the arcs of G respectively. It is known that an arc-transitive graph is both vertex-transitive and edge-transitive. However, a graph which is both vertex-transitive and edge-transitive may not be arc-transitive, the smallest example being the Holt graph [9] on 27 vertices. Such graphs are called half-transitive graphs. For other definitions related to algebraic graph theory, one is referred to [8]. The study of half-transitive graphs was initiated by Tutte [12], who proved that any half-transitive graph is of even degree. Since any connected 2-regular is a cycle and a cycle is arc-transitive, the first possibility of finding a half-transitive graph is a 4-regular or tetravalent graph. The first example of tetravalent half-transitive graphs were given by Bouwer [2] and the smallest example was given in Holt [9]. Though numerous papers have arXiv:2008.07525v1 [math.CO] 16 Aug 2020 been published in the last 50 years, the classification of tetravalent half-transitive graphs is not yet complete.
    [Show full text]
  • Graph Symmetries
    Summer School on Discrete Mathematics (Rogla, Slovenia, June 2013) Graph Symmetries Lectures by Marston Conder (University of Auckland, New Zealand) Summary • Introduction to symmetries of graphs • Vertex-transitive and arc-transitive graphs • s-arc-transitivity (including theorems of Tutte and Weiss) • Proof of Tutte's theorem on symmetric cubic graphs • Use of amalgams and covers to analyse and construct examples • Some recent developments 1 1 Introduction to symmetries of graphs Generally, an object is said to have symmetry if it can be transformed in way that leaves it looking the same as it did originally. Automorphisms: An automorphism (or symmetry) of a simple graph X = (V; E) is a permutation of the vertices of X which preserves the relation of adjacency; that is, a bijection π : V ! V such that fvπ; wπg 2 E if and only if fv; wg 2 E. Under composition, the automorphisms form a group, called the automorphism group (or symmetry group) of X, and this is denoted by Aut(X), or Aut X. Examples ∼ ∼ (a) Complete graphs and null graphs: Aut Kn = Aut Nn = Sn for all n ∼ (b) Simple cycles: Aut Cn = Dn (dihedral group of order 2n) for all n ≥ 3 ∼ (c) Simple paths: Aut Pn = S2 for all n ≥ 3 ∼ (d) Complete bipartite graphs: Aut Km;n = Sm × Sn when m 6= n, ∼ ∼ while Aut Kn;n = Sn o S2 = (Sn × Sn) o S2 (when m = n) ∼ (e) Star graphs { see above: Aut K1;n = Sn for all n > 1 ∼ (f) Wheel graphs (cycle Cn−1 plus nth vertex joined to all): Aut Wn = Dn−1 for all n ≥ 5 ∼ (g) Petersen graph: Aut P = S5 .
    [Show full text]