DOCSLIB.ORG

Primitive Permutation Groups with Soluble Stabilizers and Applications to Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. iv Abstract In the past 60 years interactions between group theory and the theory of graphs have greatly stimulated the development of each other, especially the theory of symmetric graphs (or more generally vertex-transitive graphs) has almost developed in parallel with the theory of permutation groups. The aim of this thesis is to make an effort, both in terms of pure research and broader value, to solve some challenging problems in these two fields. First we considered the problem of classifying finite primitive permutation groups with soluble stabilizers. This problem has a very long history. By the O'Nan- Scott Theorem, such groups are of type affine, almost simple, and product action. We reduced the product action type to the almost simple type, and for the latter, a complete classification was given, which forms the main result of the thesis. The main result was then used to solve some problems in algebraic graph theory. The first application of which is to classify edge-primitive s-arc-transitive graphs for s ≥ 4. After undertaking a general study on the local structures of 2-path-transitive graphs, we presented the second application by classifying finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs. The result then helps us to be able to construct some new half-transitive graphs. Another application of the main result is that a complete classification of finite vertex- biprimitive edge-transitive tetravalent graphs is given (recall that for the cubic case, the classification was given by Ivanov and Iofinova in a highly cited article in 1985). v Publications arising from this thesis 1, C. H. Li and H. Zhang, The finite primitive groups with soluble sta- bilizers, and s-arc-transitive graphs with s ≥ 4, Proc. London. Math. Soc. (3)103 (2011), 441-472. (based on Chapter 4 and Chapter 5). 2, C. H. Li and H. Zhang, On 2-path-transitive graphs, submitted to J. Graph Theory (based on Chapter 6). 3, C. H. Li and H. Zhang, Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs, submitted to J. Algebraic Combin. (based on Chapter 7). 4, C. H. Li and H. Zhang, Finite vertex-biprimitive edge-transitive tetrava- lent graphs, submitted to J. Combin. Theory, Ser. B (based on Chapter 8). vi Contents 1 Introduction1 1.1 Introduction..................................1 1.2 Literature review...............................3 1.3 Main results and the structure of this thesis................8 2 Preliminaries 10 2.1 Permutation groups............................. 10 2.2 Orbits, stabilizers, and transitivity..................... 12 2.3 Blocks, primitivity, and the O'Nan-Scott Theorem............ 14 2.3.1 The O'Nan-Scott Theorem..................... 15 2.4 More on almost simple groups........................ 18 2.5 The subgroup structure of the classical groups............... 20 3 Graphs 22 3.1 Basic concepts of graphs........................... 22 3.2 Symmetries of graphs............................ 23 3.3 General constructions of graphs....................... 26 4 Finite primitive groups with soluble stabilizers. 31 4.1 The main result................................ 31 4.2 A reduction for the proof of Theorem 4.1.1................ 33 4.3 Subgroups of classical groups of Lie type.................. 35 4.3.1 Preliminaries............................. 36 4.3.2 Soluble maximal Ci-subgroups.................... 37 4.3.3 The maximality............................ 43 4.4 Subgroups of linear groups.......................... 45 4.5 Subgroups of symplectic groups....................... 51 4.6 Subgroups of unitary groups......................... 53 4.7 Subgroups of orthogonal groups....................... 56 4.8 Tables..................................... 58 1 Contents 5 Finite edge-primitive s-arc-transitive graphs with s ≥ 4 66 5.1 The classification............................... 66 5.2 A reduction for the proof of Theorem 5.1.1................ 67 5.2.1 s-Arc transitive graphs........................ 67 5.2.2 Edge-primitive graphs........................ 69 5.3 Proof of Theorem 5.1.1............................ 70 6 Finite 2-path-transitive graphs 74 6.1 The problem and the results......................... 74 6.2 Proofs of Theorems 6.1.1 and 6.1.2..................... 76 6.3 Line graphs.................................. 80 6.4 Proof of Theorem 6.1.4............................ 81 7 Finite vertex-primitive and vertex-biprimitive 2-path-transitive graph- s. 86 7.1 The main results............................... 86 7.2 A reduction.................................. 88 7.3 Examples................................... 90 7.4 Proof of the main theorems......................... 96 7.4.1 Proof of Theorem 7.1.1....................... 96 7.4.2 Proof of Theorem 7.1.2....................... 98 7.4.3 Proof of Theorem 7.1.3....................... 100 7.5 The numbers of the non-isomorphic graphs................ 100 8 Finite vertex-biprimitive edge-transitive tetravalent graphs 104 8.1 The classification............................... 104 8.2 Examples................................... 106 8.3 Local structure of edge-transitive tetravalent graphs........... 109 8.4 A reduction.................................. 111 8.5 Almost simple type.............................. 114 8.6 Proof of Theorem 8.1.1............................ 120 9 Bibliography 124 2 Contents Nomenclature Groups Fq Field with q elements G; H; K Groups n Arbitary soluble group of order n Zn Cyclic group of order n G0 Derived group of G G:H Extension of G by H G:H Split extension of G by H jG:Hj Set of right cosets of H in G NG(H) Normalizer of H in G CG(H) Centralizer of H in G Out(G) Outer automorphism group of G Sn Symmetric group of degree n An Alternating group of degree n Gα Stabilizer of α in G G(∆) Pointwise stabilizer of ∆ in G G∆ Setwise stabilizer of ∆ in G AGLn(q) Affine groups of dimension n over Fq PSLn(q); PSUn(q) Classical groups of Lie type of dimension n over Fq 3 Contents Graphs Γ ; Σ Graphs V Γ Vertex set of Γ EΓ Edge set of Γ AΓ Arc set of Γ AutΓ Full automorphism group of Γ V al(Γ ) Valency of a regular graph Γ Cn Cycle of degree n Kn Complete graph of degree n Kn;m Complete bipartite graph of degree n + m Γ (α) Neighborhood of α [1] Gα Kernel of Gα acting on Γ (α) Γ(α) Gα Induced permutation group of Gα on Γ (α) ΓN Quotient graph of Γ with respect to normal subgroup N Cos(G; H; HgH) Coset graph Cos(G; L; R) Double coset graph 4 Chapter 1 Introduction 1.1 Introduction In the past 60 years interactions between group theory and the theory of graphs have greatly stimulated the development of each other, especially the theory of symmetric graphs (or more generally vertex-transitive graphs) has almost developed in parallel with the theory of permutation groups. The study of symmetric graphs has long been one of the main themes in algebraic graph theory. In early work in [95, 99, 103, 119, 120, 128, 133], finite group theory was used in the study of vertex-transitive graphs and many surprising results were obtained; while in [95, 106, 124, 129] ideas derived from graph theory were used to obtain strong and deep results about permutation groups, and new descriptions of some finite simple groups, and more importantly some new and interesting classes of permutation groups were found. Following the Classification of Finite Simple Groups (henceforth referred to as CFSG), together with the O'Nan-Scott Theorem about the finite primitive groups, more and more classes of symmetric graphs have been completely determined. In recent years symmetric graphs with additional properties, such as vertex-primitive or quasiprimitive graphs, locally primitive graphs, and s-arc-transitive graphs for s ≥ 2, just to name a few, have been extensively studied, see [41, 43, 44, 68, 69, 95, 97]. However, many challenging problems in this field still remain unsettled. The aim of this thesis is to make an effort towards this direction. The study will mainly be centered around the following aspects: • adding new information in permutation group theory, and • extending the knowledge of symmetric graphs. By definition a graph Γ is called symmetric if its automorphism group acts transi- tively on the set of the arcs. For some positive integer s, Γ is called s-arc-transitive if the automorphism group acts transitively on the set of s-arcs.
Load more

Recommended publications
  • On the Metric Dimension of Imprimitive Distance-Regular Graphs
    On the metric dimension of imprimitive distance-regular graphs Robert F. Bailey Abstract. A resolving set for a graph Γ is a collection of vertices S, cho- sen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. Much attention has been paid to the metric di- mension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimension of primitive distance- regular graphs in terms of their parameters. We show how the metric dimension of an imprimitive distance-regular graph can be related to that of its halved and folded graphs, but also consider infinite families (including Taylor graphs and the incidence graphs of certain symmetric designs) where more precise results are possible. Mathematics Subject Classification (2010). Primary 05E30; Secondary 05C12. Keywords. Metric dimension; resolving set; distance-regular graph; imprimitive; halved graph; folded graph; bipartite double; Taylor graph; incidence graph. 1. Introduction Let Γ = (V; E) be a finite, undirected graph without loops or multiple edges. For u; v 2 V , the distance from u to v is the least number of edges in a path from u to v, and is denoted dΓ(u; v) (or simply d(u; v) if Γ is clear from the context). A resolving set for a graph Γ = (V; E) is a set of vertices R = fv1; : : : ; vkg such that for each vertex w 2 V , the list of distances (d(w; v1);:::; d(w; vk)) uniquely determines w.
    [Show full text]
  • Small Integral Trees
    Small integral trees A. E. Brouwer Dept. of Math., Techn. Univ. Eindhoven P.O. Box 513, 5600MB Eindhoven, Netherlands [email protected] Submitted: Dec 31, 2007; Accepted: Jan 18, 2008; Published: Jan 28, 2008 Mathematics Subject Classification: 05C05, 05C30, 05E99 Abstract We give a table with all integral trees on at most 50 vertices, and characterize integral trees with a single eigenvalue 0. 1 Integral trees A finite graph is called integral if the spectrum of its adjacency matrix has only integral eigenvalues. A tree is a connected undirected graph without cycles. In this note we give a table with all integral trees on at most 50 vertices, and a further table with all known integral trees on at most 100 vertices. (For an on-line version, possibly with updates, see [1].) In particular, we find the smallest integral trees of diameter 6, and the smallest known integral tree of diameter 8. The nicest result about integral trees is that by Watanabe [12] that says that an integral tree different from K2 does not have a complete matching. Here we give a gener- alization. All `starlike' integral trees, that is, all integral trees with at most one vertex of degree larger than 2, were given by Watanabe and Schwenk [13]. All integral trees of diameter at most 3 were given in [13, 4]. See also [10, 3]. Several people have worked on constructing integral trees with large diameter, and examples with diameters 0{8 and 10 are known, see [13, 9, 3, 8, 6, 7]. It is unknown whether integral trees can have arbitrarily large diameter.
    [Show full text]
  • 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]
  • Bidirected Graph from Wikipedia, the Free Encyclopedia Contents
    Bidirected graph From Wikipedia, the free encyclopedia Contents 1 Bidirected graph 1 1.1 Other meanings ............................................ 1 1.2 See also ................................................ 2 1.3 References ............................................... 2 2 Bipartite double cover 3 2.1 Construction .............................................. 3 2.2 Examples ............................................... 3 2.3 Matrix interpretation ......................................... 4 2.4 Properties ............................................... 4 2.5 Other double covers .......................................... 4 2.6 See also ................................................ 5 2.7 Notes ................................................. 5 2.8 References ............................................... 5 2.9 External links ............................................. 6 3 Complex question 7 3.1 Implication by question ........................................ 7 3.2 Complex question fallacy ....................................... 7 3.2.1 Similar questions and fallacies ................................ 8 3.3 Notes ................................................. 8 4 Directed graph 10 4.1 Basic terminology ........................................... 11 4.2 Indegree and outdegree ........................................ 11 4.3 Degree sequence ............................................ 12 4.4 Digraph connectivity .......................................... 12 4.5 Classes of digraphs .........................................
    [Show full text]
  • Péter Szilárd Metric Dimension of Distance-Regular Graphs and Finite
    Eotv¨ os¨ Lorand´ University Faculty of Science P´eterSzil´ard Metric dimension of distance-regular graphs and finite projective planes BSc Thesis Supervisor: Tam´asH´eger Research fellow MTA{ELTE Geometric and Algebraic Combinatorics Research Group Budapest, 2017 Acknowledgements I am immensely grateful to my supervisor Tam´asH´egernot only for introducing me to the topic and providing clear and always useful professional advice but also for being there to reassure and cheer me whenever I needed it the most. I am also thankful to my friends and family, who stood beside me and bore with me during the whole of this journey. i Introduction The purpose of this thesis is to introduce the notion of metric dimension and sum- marise part of the results currently known about it especially those relating to distance-regular graphs and projective planes. Also, to present a result pertaining to the metric dimension of finite projective planes, first published in a 2012 arti- cle by Tam´asH´egerand Marcella Tak´ats[19] and refined further by the present author for the purpose of this thesis. Metric dimension is a natural graph theoretic concept studied as far back as the 1950's and since then consequently by various authors. It proved to be a quite elusive topic however, as apart from a few general observations and theorems, the majority of the current results detail very special cases of graphs. This is due to the fact that the metric dimension has a strong connection to the structure of a graph and thus graphs with special constructions or generally of interesting properties prove to be more fruitful to investigate.
    [Show full text]
  • 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.
    [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]
  • On the Cheeger Constant for Distance-Regular Graphs. Arxiv:1811.00230V2
    On the Cheeger constant for distance-regular graphs. Jack H. Koolen 1, Greg Markowsky 2 and Zhi Qiao 3 [email protected] [email protected] [email protected] 1Wen-Tsun Wu Key Laboratory of the CAS and School of Mathematical Sciences, USTC, Hefei, China 2Department of Mathematics, Monash University, Australia 3College of Mathematics and Software Science, Sichuan Normal University, China September 19, 2019 Abstract The Cheeger constant of a graph is the smallest possible ratio between the size of a subgraph and the λ1 size of its boundary. It is well known that this constant must be at least 2 , where λ1 is the smallest positive eigenvalue of the Laplacian matrix. The subject of this paper is a conjecture of the authors that for distance-regular graphs the Cheeger constant is at most λ1. In particular, we prove the conjecture for the known infinite families of distance-regular graphs, distance-regular graphs of diameter 2 (the strongly regular graphs), several classes of distance-regular graphs with diameter 3, and most distance-regular graphs with small valency. 1 Introduction The Cheeger constant hG of a graph G is a prominent measure of the connectivity of G, and is defined as arXiv:1811.00230v2 [math.CO] 18 Sep 2019 nE[S; Sc] jV (G)jo (1) h = inf jS ⊂ V (G) with jSj ≤ ; G vol(S) 2 where V (G) is the vertex set of G, vol(S) is the sum of the valencies of the vertices in S, Sc is the complement of S in V (G), jSj is the number of vertices in S, and for any sets A; B we use E[A; B] to denote the number of edges in G which connect a point in A with a point in B; to make this last definition more precise, let E(G) ⊆ V (G) × V (G) denote the edge set of G, and then E[A; B] = jf(x; y) 2 E(G) with x 2 A; y 2 Bgj; note that with this definition each edge (x; y) with x; y 2 A \ B will in essence be counted twice, and 1 c vol(S) = E[S; S] + E[S; S ].
    [Show full text]
  • Th Slovenian International Conference on Graph Theory
    Abstracts of the 9th Slovenian International Conference on Graph Theory Bled, Slovenia, June 23 – 29, 2019 9th Slovenian International Conference on Graph Theory BLED’19 Institute of Mathematics, Physics and Mechanics Abstracts of the 9th Slovenian International Conference on Graph Theory Bled, Slovenia, June 23 – 29, 2019 Institute of Mathematics, Physics and Mechanics June 2019 Abstracts of the 9th Slovenian International Conference on Graph Theory Bled, Slovenia, June 23 – 29, 2019 Editors: Sergio Cabello, Bojan Mohar Published by the Institute of Mathematics, Physics and Mechanics, IMFM Jadranska 19, 1000 Ljubljana 350 printed copies Electronically available at https://conferences.matheo.si/e/bled19 Ljubljana, June 2019 CIP - Kataložni zapis o publikaciji Narodna in univerzitetna knjižnica, Ljubljana 519.17(082) SLOVENIAN International Conference on Graph Theory (9 ; 2019 ; Bled) Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019 / [editors Sergio Cabello, Bojan Mohar]. - Ljubljana : Institute of Mathematics, Physics and Mechanics, IMFM, 2019 ISBN 978-961-92681-1-7 1. Cabello, Sergio COBISS.SI-ID 300523520 Welcome We thank all of you for coming to the 9th Slovenian International Conference on Graph Theory, Bled’19, and wish you a pleasant and successful meeting in Bled. This conference has come a long way from its first meeting in Dubrovnik (now in Croatia) in 1985. The second meeting of the series Slovenian (International) Conference on Graph Theory was held at Lake Bled in 1991, following by the subsequent meetings at the same location in 1995, 1999, 2003, 2007, and 2011. In 2015 the meeting took place in Kranjska Gora.
    [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]