DOCSLIB.ORG

Spectral and Combinatorial Properties of Friendship Graphs, Simplicial Rook

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Spectral and Combinatorial Properties of Friendship Graphs, Simplicial Rook SPECTRAL AND COMBINATORIAL PROPERTIES OF FRIENDSHIP GRAPHS, SIMPLICIAL ROOK GRAPHS, AND EXTREMAL EXPANDERS by Jason R. Vermette A dissertation submitted to the Faculty of the University of Delaware in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics Spring 2015 c 2015 Jason R. Vermette All Rights Reserved ProQuest Number: 3718380 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. ProQuest 3718380 Published by ProQuest LLC (2015). Copyright of the Dissertation is held by the Author. All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code Microform Edition © ProQuest LLC. ProQuest LLC. 789 East Eisenhower Parkway P.O. Box 1346 Ann Arbor, MI 48106 - 1346 SPECTRAL AND COMBINATORIAL PROPERTIES OF FRIENDSHIP GRAPHS, SIMPLICIAL ROOK GRAPHS, AND EXTREMAL EXPANDERS by Jason R. Vermette Approved: Louis F. Rossi, Ph.D. Chair of the Department of Mathematical Sciences Approved: George H. Watson, Ph.D. Dean of the College of Arts & Sciences Approved: James G. Richards, Ph.D. Vice Provost for Graduate and Professional Education I certify that I have read this dissertation and that in my opinion it meets the academic and professional standard required by the University as a dissertation for the degree of Doctor of Philosophy. Signed: Sebastian M. Cioab˘a,Ph.D. Professor in charge of dissertation I certify that I have read this dissertation and that in my opinion it meets the academic and professional standard required by the University as a dissertation for the degree of Doctor of Philosophy. Signed: Robert S. Coulter, Ph.D. Member of dissertation committee I certify that I have read this dissertation and that in my opinion it meets the academic and professional standard required by the University as a dissertation for the degree of Doctor of Philosophy. Signed: Felix G. Lazebnik, Ph.D. Member of dissertation committee I certify that I have read this dissertation and that in my opinion it meets the academic and professional standard required by the University as a dissertation for the degree of Doctor of Philosophy. Signed: Steven K. Butler, Ph.D. Member of dissertation committee ACKNOWLEDGEMENTS I would like to thank Andrew Lang for sparking my interest in the theoretical side of mathematics during my time as an undergraduate. Thanks to my dissertation committee for taking the time to carefully read this thesis and offer advice and suggestions to improve it. Thanks to my adviser, Sebi Cioab˘a,for his patience and instruction for the past several years. His guidance was integral to my success as a graduate student. I would also like to thank him for his extremely useful comments on earlier versions of this thesis. Thanks most of all to my wife, Sharayah, for her endless support throughout my graduate career. I would certainly not have made it this far without her. iv TABLE OF CONTENTS LIST OF TABLES :::::::::::::::::::::::::::::::: vii LIST OF FIGURES ::::::::::::::::::::::::::::::: viii ABSTRACT ::::::::::::::::::::::::::::::::::: xi Chapter 1 INTRODUCTION :::::::::::::::::::::::::::::: 1 1.1 Algebraic Combinatorics ::::::::::::::::::::::::: 1 1.2 Definitions, Notation, and Basics of Graph Theory ::::::::::: 3 1.3 Spectra of Graphs ::::::::::::::::::::::::::::: 14 1.4 Vertex Partitions, Quotient Matrices, and Eigenvalue Interlacing ::: 19 1.5 Which Graphs are Determined by Their Spectra? ::::::::::: 24 2 THE FRIENDSHIP GRAPH AND GRAPHS WITH 4 DISTINCT EIGENVALUES ::::::::::::::::::::::::::::::: 28 2.1 The Friendship Graph :::::::::::::::::::::::::: 28 2.2 Connected Graphs Cospectral to the Friendship Graph :::::::: 31 2.3 The Graphs With All But Two Eigenvalues Equal to 1 or −1 ::::: 37 2.4 Characterization of the Graphs in G. :::::::::::::::::: 38 2.5 The Proof of the Characterization of G ::::::::::::::::: 42 3 SIMPLICIAL ROOK GRAPHS ::::::::::::::::::::: 56 3.1 Rook Graphs and Simplicial Rook Graphs ::::::::::::::: 56 3.2 Independence Number :::::::::::::::::::::::::: 60 3.3 The Smallest Eigenvalue ::::::::::::::::::::::::: 64 3.4 Partial Spectrum ::::::::::::::::::::::::::::: 67 3.5 Spectrum of SR(m; n) for m ≤ 3 or n ≤ 3 ::::::::::::::: 71 3.6 Integrality of the Spectrum :::::::::::::::::::::::: 76 3.7 Diameter :::::::::::::::::::::::::::::::::: 79 3.8 Clique Number :::::::::::::::::::::::::::::: 82 v 3.9 Cospectral Mates ::::::::::::::::::::::::::::: 84 3.10 Multiplicity of the Smallest Eigenvalue ::::::::::::::::: 88 3.11 Spectrum of SR(m; n) for m; n ≥ 4 ::::::::::::::::::: 91 4 LARGE REGULAR GRAPHS WITH FIXED VALENCY AND SECOND EIGENVALUE ::::::::::::::::::::::::: 98 4.1 The Second Eigenvalue of Regular Graphs ::::::::::::::: 98 4.2 Interlacing Bound ::::::::::::::::::::::::::::: 100 4.3 Results of the Interlacing Bound ::::::::::::::::::::: 102 4.4 Linear Programming Bound ::::::::::::::::::::::: 115 5 OPEN PROBLEMS AND FUTURE WORK ::::::::::::: 121 5.1 The Graphs With All But Two Eigenvalues Equal to 0 or −2 ::::: 121 5.2 Partial Permutohedra ::::::::::::::::::::::::::: 126 5.3 Problems and Questions on the Second Eigenvalue of Regular Graphs 136 BIBLIOGRAPHY :::::::::::::::::::::::::::::::: 139 vi LIST OF TABLES 3.1 Spectrum of SR(3; n). ::::::::::::::::::::::::: 71 3.2 Spectrum of SR(m; 3). ::::::::::::::::::::::::: 72 3.3 Spectrum of SR(m; 4). ::::::::::::::::::::::::: 93 3.4 Spectrum of SR(m; 5). ::::::::::::::::::::::::: 94 3.5 Spectra of SR(4; n). :::::::::::::::::::::::::: 96 3.6 Spectra of SR(5; n). :::::::::::::::::::::::::: 97 4.1 Families of graphs meeting the bound M(k; t; c). ::::::::::: 118 4.2 Sporadic of graphs meeting the bound M(k; t; c). :::::::::: 118 4.3 Summary of our results. :::::::::::::::::::::::: 120 vii LIST OF FIGURES 1.1 The Graphs P3 and C5. :::::::::::::::::::::::: 3 1.2 The complements of P3 and C5. :::::::::::::::::::: 6 ∼ 1.3 The graphs K5, K3;2, Ci10(1; 4), and K2;2;2 = CP (3). :::::::: 7 1.4 The graphs P3, C3, and P3 [ C3. :::::::::::::::::::: 8 1.5 The graphs P3, C3, P3 + C3, and P3 r C3. :::::::::::::: 8 1.6 The graphs P3, C3, and P3C3. :::::::::::::::::::: 8 1.7 The graphs Q0, Q1, Q2, Q3, and Q4. ::::::::::::::::: 9 1.8 Block and standard representation of graphs. :::::::::::: 9 1.9 The Petersen graph. :::::::::::::::::::::::::: 11 1.10 The Rook graph R(2; 3). :::::::::::::::::::::::: 11 1.11 The Heawood graph. :::::::::::::::::::::::::: 12 1.12 The Tutte{Coxeter graph. ::::::::::::::::::::::: 12 1.13 Two nonisomorphic graphs with spectrum f21; 03; −21g. :::::: 24 1.14 A pair of nonisomorphic cospectral graphs on 9 vertices obtained by GM-switching. ::::::::::::::::::::::::::::: 27 1.15 A pair of nonisomorphic cospectral graphs on 7 vertices obtained by GM-switching. ::::::::::::::::::::::::::::: 27 2.1 The Friendship graph Fk for several values of k. ::::::::::: 28 2.2 Graphs with λ2 > 1 or λmin −1 < −1. ::::::::::::::::: 33 viii 2.3 The graphs in G. :::::::::::::::::::::::::::: 40 2.4 The graph F16 and its cospectral mate B6(3; 5) + 10K2. ::::::: 41 2.5 A subgraph induced by G if a vertex in Z0 has two neighbors in Z0. 51 3.1 The integer lattice points in the n-th dilate of the standard simplex in R3, n = 1; 2. ::::::::::::::::::::::::::::::: 57 3.2 Lattice points in the n-th dilate of the standard simplex in R3 viewed as 3-tuples summing to n, n = 2; 3. :::::::::::::::::: 58 3.3 The Simplicial Rook graphs SR(3; 4) and SR(4; 3). ::::::::: 59 3.4 Maximal independent sets in SR(3; 8), SR(3; 9), and SR(3; 10). :: 61 3.5 Maximal independent sets in SR(3; 3) and SR(4; 3). ::::::::: 65 3.6 Maximal cliques of size m = 4 and n + 1 = 4 in SR(4; 3). :::::: 82 3.7 The set V1 as a GM-switching set in SR(4; 3). :::::::::::: 85 3.8 The set f3e1; 2e1 + e2; e1 + 2e2; 3e2g as a GM-switching set in SR(4; 3). ::::::::::::::::::::::::::::::::: 87 4.1 Two small graphs with spectral radius greater than 2. :::::::: 100 4.2 The Tutte{Coxeter graph. ::::::::::::::::::::::: 103 4.3 The Odd graph O4. ::::::::::::::::::::::::::: 105 4.4 The Heawood graph. :::::::::::::::::::::::::: 107 4.5 A 3-regular graph on 8 vertices with girth 4. ::::::::::::: 108 p 4.6 The 4-regular graphs λ2 = 5 − 1. :::::::::::::::::: 110 4.7 The 3-regular graphs on 18 vertices with λ2 < 1:9. :::::::::: 113 4.8 A graph with spectral radius 2. :::::::::::::::::::: 113 5.1 Graphs inducing line graphs with two positive eigenvalues. ::::: 125 ix 5.2 The π-admissible permutations for π = (3; 2; 1; 4). :::::::::: 128 5.3 The subgraph SR(4; 3)jParp(π) for π = (3; 2; 1; 4). ::::::::::: 129 5.4 The subgraph SR(4; 3)jParp(π) for π = (3; 2; 1; 4) within SR(4; 3). :: 129 5.5 The unique 3-regular graph with largest least eigenvalue less than −2. 137 x ABSTRACT Algebraic combinatorics is the area of mathematics that uses the theories and methods of abstract and linear algebra to solve combinatorial problems, or conversely applies combinatorial techniques to solve problems in algebra. In particular, spectral graph theory applies the techniques of linear algebra to study graph theory. Spec- tral graph theory is the study of the eigenvalues of various matrices associated with graphs and how they relate to the properties of those graphs. The graph properties of diameter, independence number, chromatic number, connectedness, toughness, hamil- tonicity, and expansion, among others, are all related to the spectra of graphs. In this thesis we study the spectra of various families of graphs, how their spectra relate to their properties, and when graphs are determined by their spectra. We focus on three topics (Chapters 2{4) in spectral graph theory. The wide range of these topics showcases the power and versatility of the eigenvalue techniques such as interlacing, the common thread that ties these topics together. In Chapter1, we review the basic definitions, notations, and results in graph theory and spectral graph theory. We also introduce powerful tools for determining the structure of a graph and its subgraphs using eigenvalue interlacing.
Load more

Recommended publications
  • Connectivities and Diameters of Circulant Graphs
    CONNECTIVITIES AND DIAMETERS OF CIRCULANT GRAPHS Paul Theo Meijer B.Sc. (Honors), Simon Fraser University, 1987 THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE (MATHEMATICS) in the Department of Mathematics and Statistics @ Paul Theo Meijer 1991 SIMON FRASER UNIVERSITY December 1991 All rights reserved. This work may not be reproduced in whole or in part, by photocopy or other means, without permission of the author. Approval Name: Paul Theo Meijer Degree: Master of Science (Mathematics) Title of Thesis: Connectivities and Diameters of Circulant Graphs Examining Committee: Chairman: Dr. Alistair Lachlan Dr. grian Alspach, Professor ' Senior Supervisor Dr. Luis Goddyn, Assistant Professor - ph Aters, Associate Professor . Dr. Tom Brown, Professor External Examiner Date Approved: December 4 P 1991 PART IAL COPYH IGIiT L ICLNSI: . , I hereby grant to Sirnori Fraser- llr~ivorsitytho righl to lend my thesis, project or extended essay (tho title of which is shown below) to users of the Simon Frasor University Libr~ry,and to make part ial or single copies only for such users or in response to a request from the library of any other university, or other educational insfitution, on 'its own behalf or for one of its users. I further agree that percnission for multiple copying of this work for scholarly purposes may be granted by me or the Dean of Graduate Studies. It is understood that copying or publication of this work for financial gain shall not be allowed without my written permission. Title of Thesis/Project/Extended Essay (date) Abstract Let S = {al, az, .
    [Show full text]
  • Non-Hamiltonian 3–Regular Graphs with Arbitrary Girth
    Universal Journal of Applied Mathematics 2(1): 72-78, 2014 DOI: 10.13189/ujam.2014.020111 http://www.hrpub.org Non-Hamiltonian 3{Regular Graphs with Arbitrary Girth M. Haythorpe School of Computer Science, Engineering and Mathematics, Flinders University, Australia ∗Corresponding Author: michael.haythorpe@flinders.edu.au Copyright ⃝c 2014 Horizon Research Publishing All rights reserved. Abstract It is well known that 3{regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3{regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1{, 2{ or 3{edge-connected de- pending on the construction chosen. From the constructions arise (naive) upper bounds on the size of the smallest non-Hamiltonian 3{regular graphs with particular girth. Several examples are given of the smallest such graphs for various choices of girth and connectedness. Keywords Girth, Cages, Cubic, 3-Regular, Prisons, Hamiltonian, non-Hamiltonian 1 Introduction Consider a k{regular graph Γ with girth g, containing N vertices. Then Γ is said to be a (k; g){cage if and only if all other k{regular graphs with girth g contain N or more vertices. The study of cages, or cage graphs, goes back to Tutte [15], who later gave lower bounds on n(k; g), the number of vertices in a (k; g){cage [16]. The best known upper bounds on n(k; g) were obtained by Sauer [14] around the same time. Since that time, the advent of vast computational power has enabled large-scale searches such as those conducted by McKay et al [10], and Royle [13] who maintains a webpage with examples of known cages.
    [Show full text]
  • ISOMETRIC SUBGRAPHS of HAMMING GRAPHS and D-CONVEXITY
    4. K.V. Rudakov, "Completeness and universal constraints in the problem of correction of heuristic classification algorithms," Kibernetika, No, 3, 106-109 (1987). 5. K.V. Rudakov, "Symmetry and function constraints in the problem of correction of heur- istic classification algorithms," Kibernetika, No. 4, 74-77 (1987). 6. K.V. Rudakov, On Some Classes of Recognition Algorithms (General Results) [in Russian], VTs AN SSSR, Moscow (1980). ISOMETRIC SUBGRAPHS OF HAMMING GRAPHS AND d-CONVEXITY V. D. Chepoi UDC 519.176 In this study, we provide criteria of isometric embeddability of graphs in Hamming graphs. We consider ordinary connected graphs with a finite vertex set endowed with the natural metric d(x, y), equal to the number of edges in the shortest chain between the ver- tices x and y. Let al,...,a n be natural numbers. The Hamming graph Hal...a n is the graph with the ver- tex set X = {x = (x l..... xn):l~xi~a~, ~ = l,...n} in which two vertices are joined by an edge if and only if the corresponding vectors differ precisely in one coordinate [i, 2]. In other words, the graph Hal...a n is the Cartesian product of the graphs Hal,...,Han, where Hal is the ai-vertex complete graph. It is easy to show that in the Hamming graph the distance d(x, y) between the vertices x, y is equal to the number of different pairs of coordinates in the tuples corresponding to these vertices, i.e., it is equal to the Hamming distance between these tuples. It is also easy to show that the graph of the n-dimensional cube Qn may be treated as the Hamming graph H2..
    [Show full text]
  • Towards a Classification of Distance-Transitive Graphs
    数理解析研究所講究録 1063 巻 1998 年 72-83 72 Towards a classification of distance-transitive graphs John van Bon Abstract We outline the programme of classifying all finite distance-transitive graphs. We men- tion the most important classification results obtained so far and give special attention to the so called affine graphs. 1. Introduction The graphs in this paper will be always assumed to be finite, connected, undirected and without loops or multiple edges. The edge set of a graph can thus be identified with a subset of the set of unoidered pairs of vertices. Let $\Gamma=(V\Gamma, E\Gamma)$ be a graph and $x,$ $y\in V\Gamma$ . With $d(x, y)$ we will denote the usual distance $\Gamma$ in between the vertices $x$ and $y$ (i.e., the length of the shortest path connecting $x$ and $y$ ) and with $d$ we will denote the diameter of $\Gamma$ , the maximum of all possible values of $d(x, y)$ . Let $\Gamma_{i}(x)=\{y|y\in V\Gamma, d(x, y)=i\}$ be the set of all vertices at distance $i$ of $x$ . An $aut_{omo}rph7,sm$ of a graph is a permutation of the vertex set that maps edges to edges. Let $G$ be a group acting on a graph $\Gamma$ (i.e. we are given a morphism $Garrow Aut(\Gamma)$ ). For a $x\in V\Gamma$ $x^{g}$ vertex and $g\in G$ the image of $x$ under $g$ will be denoted by . The set $\{g\in G|x^{g}=x\}$ is a subgroup of $G$ , called that stabilizer in $G$ of $x$ and will be denoted by $G_{x}$ .
    [Show full text]
  • On the Classification of Locally Hamming Distance-Regular Graphs
    数理解析研究所講究録 第 76850巻 1991 年 50-61 On the Classification of Locally Hamming Distance-Regular Graphs BY MAKOTO MATSUMOTO Abstract. A distance-regular graph is locally Hamming if it is locally isomorphic to a Hamming scheme $H(r, 2)$ . This paper rediscovers the connection among locally Ham- ming distance-regular graphs, designs, and multiply transitive permutation groups, through which we classify some of locally Hamming distance-transitive graphs. \S 1. Introduction. By a graph we shall mean a finite undirected graph with no loops and no multiple edges. For a graph $G,$ $V(G)$ denotes the vertex set and $E(G)$ denotes the edge set of $G$ . For a vertex $v$ of a graph $G,$ $N(v)$ denotes the set of adjacent vertices with $v$ . By $\ovalbox{\tt\small REJECT}_{2}$ we denote the two-element field, and by $H(r)$ we denote the r-dimensional Hamming scheme for $r\geq 1$ ; that is, $H(r)$ is such a graph that its vertex set is the $\#_{2}^{=r}$ vector space a,nd $\tau\iota,$ $v\in\#_{2}^{=r}$ are adjacent if and only if the Hamming distance $d(u, v)=1$ ; i.e., $\#\{i u_{i}\neq v_{i}\}=1$ where $u=(u_{1}, \ldots u_{r})$ and $v=(v_{1}, \ldots , v_{r})$ . The graph obtained from $H(r)$ by identifying antipodal points is called a folded Hamming sheme(or a folded Hamming cube in [3, p.140]). The graph $H(3)$ is called a cube, and the induced subgraph obtained by removing one vertex tog$e$ ther with the three incident edges from a cube is called a tulip.
    [Show full text]
  • Ssp Structure of Some Graph Classes
    International Journal of Pure and Applied Mathematics Volume 101 No. 6 2015, 939-948 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: A http://www.ijpam.eu P ijpam.eu SSP STRUCTURE OF SOME GRAPH CLASSES R. Mary Jeya Jothi1, A. Amutha2 1,2Department of Mathematics Sathyabama University Chennai, 119, INDIA Abstract: A Graph G is Super Strongly Perfect if every induced sub graph H of G possesses a minimal dominating set that meets all maximal cliques of H. Strongly perfect, complete bipartite graph, etc., are some of the most important classes of super strongly perfect graphs. Here, we analyse the other classes of super strongly perfect graphs like trivially perfect graphs and very strongly perfect graphs. We investigate the structure of super strongly perfect graph in friendship graphs. Also, we discuss the maximal cliques, colourability and dominating sets in friendship graphs. AMS Subject Classification: 05C75 Key Words: super strongly perfect graph, trivially perfect graph, very strongly perfect graph and friendship graph 1. Introduction Super strongly perfect graph is defined by B.D. Acharya and its characterization has been given as an open problem in 2006 [5]. Many analysation on super strongly perfect graph have been done by us in our previous research work, (i.e.,) we have investigated the classes of super strongly perfect graphs like strongly c 2015 Academic Publications, Ltd. Received: March 12, 2015 url: www.acadpubl.eu 940 R.M.J. Jothi, A. Amutha perfect, complete bipartite graph, etc., [3, 4]. In this paper we have discussed some other classes of super strongly perfect graphs like trivially perfect graph, very strongly perfect graph and friendship graph.
    [Show full text]
  • THE CRITICAL GROUP of a LINE GRAPH: the BIPARTITE CASE Contents 1. Introduction 2 2. Preliminaries 2 2.1. the Graph Laplacian 2
    THE CRITICAL GROUP OF A LINE GRAPH: THE BIPARTITE CASE JOHN MACHACEK Abstract. The critical group K(G) of a graph G is a finite abelian group whose order is the number of spanning forests of the graph. Here we investigate the relationship between the critical group of a regular bipartite graph G and its line graph line G. The relationship between the two is known completely for regular nonbipartite graphs. We compute the critical group of a graph closely related to the complete bipartite graph and the critical group of its line graph. We also discuss general theory for the critical group of regular bipartite graphs. We close with various examples demonstrating what we have observed through experimentation. The problem of classifying the the relationship between K(G) and K(line G) for regular bipartite graphs remains open. Contents 1. Introduction 2 2. Preliminaries 2 2.1. The graph Laplacian 2 2.2. Theory of lattices 3 2.3. The line graph and edge subdivision graph 3 2.4. Circulant graphs 5 2.5. Smith normal form and matrices 6 3. Matrix reductions 6 4. Some specific regular bipartite graphs 9 4.1. The almost complete bipartite graph 9 4.2. Bipartite circulant graphs 11 5. A few general results 11 5.1. The quotient group 11 5.2. Perfect matchings 12 6. Looking forward 13 6.1. Odd primes 13 6.2. The prime 2 14 6.3. Example exact sequences 15 References 17 Date: December 14, 2011. A special thanks to Dr. Victor Reiner for his guidance and suggestions in completing this work.
    [Show full text]
  • Cubic Vertex-Transitive Graphs of Girth Six
    CUBIC VERTEX-TRANSITIVE GRAPHS OF GIRTH SIX PRIMOZˇ POTOCNIKˇ AND JANOSˇ VIDALI Abstract. In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth 6 is obtained. It is proved that every such graph, with the exception of the Desargues graph on 20 vertices, is either a skeleton of a hexagonal tiling of the torus, the skeleton of the truncation of an arc-transitive triangulation of a closed hyperbolic surface, or the truncation of a 6-regular graph with respect to an arc- transitive dihedral scheme. Cubic vertex-transitive graphs of girth larger than 6 are also discussed. 1. Introduction Cubic vertex-transitive graph are one of the oldest themes in algebraic graph theory, appearing already in the classical work of Foster [13, 14] and Tutte [33], and retaining the attention of the community until present times (see, for example, the works of Coxeter, Frucht and Powers [8], Djokovi´cand Miller [9], Lorimer [23], Conder and Lorimer [6], Glover and Maruˇsiˇc[15], Potoˇcnik, Spiga and Verret [27], Hua and Feng [16], Spiga [30], to name a few of the most influential papers). The girth (the length of a shortest cycle) is an important invariant of a graph which appears in many well-known graph theoretical problems, results and formulas. In many cases, requiring the graph to have small girth severely restricts the structure of the graph. Such a phenomenon can be observed when one focuses to a family of graphs of small valence possessing a high level of symmetry. For example, arc-transitive 4-valent graphs of girth at most 4 were characterised in [29].
    [Show full text]
  • Arxiv:1802.04921V2 [Math.CO]
    STABILITY OF CIRCULANT GRAPHS YAN-LI QIN, BINZHOU XIA, AND SANMING ZHOU Abstract. The canonical double cover D(Γ) of a graph Γ is the direct product of Γ and K2. If Aut(D(Γ)) = Aut(Γ) × Z2 then Γ is called stable; otherwise Γ is called unstable. An unstable graph is nontrivially unstable if it is connected, non-bipartite and distinct vertices have different neighborhoods. In this paper we prove that every circulant graph of odd prime order is stable and there is no arc- transitive nontrivially unstable circulant graph. The latter answers a question of Wilson in 2008. We also give infinitely many counterexamples to a conjecture of Maruˇsiˇc, Scapellato and Zagaglia Salvi in 1989 by constructing a family of stable circulant graphs with compatible adjacency matrices. Key words: circulant graph; stable graph; compatible adjacency matrix 1. Introduction We study the stability of circulant graphs. Among others we answer a question of Wilson [14] and give infinitely many counterexamples to a conjecture of Maruˇsiˇc, Scapellato and Zagaglia Salvi [9]. All graphs considered in the paper are finite, simple and undirected. As usual, for a graph Γ we use V (Γ), E(Γ) and Aut(Γ) to denote its vertex set, edge set and automorphism group, respectively. For an integer n > 1, we use nΓ to denote the graph consisting of n vertex-disjoint copies of Γ. The complete graph on n > 1 vertices is denoted by Kn, and the cycle of length n > 3 is denoted by Cn. In this paper, we assume that each symbol representing a group or a graph actually represents the isomorphism class of the same.
    [Show full text]
  • Cores of Vertex-Transitive Graphs
    Cores of Vertex-Transitive Graphs Ricky Rotheram Submitted in total fulfilment of the requirements of the degree of Master of Philosophy October 2013 Department of Mathematics and Statistics The University of Melbourne Parkville, VIC 3010, Australia Produced on archival quality paper Abstract The core of a graph Γ is the smallest graph Γ∗ for which there exist graph homomor- phisms Γ ! Γ∗ and Γ∗ ! Γ. Thus cores are fundamental to our understanding of general graph homomorphisms. It is known that for a vertex-transitive graph Γ, Γ∗ is vertex-transitive, and that jV (Γ∗)j divides jV (Γ)j. The purpose of this thesis is to determine the cores of various families of vertex-transitive and symmetric graphs. We focus primarily on finding the cores of imprimitive symmetric graphs of order pq, where p < q are primes. We choose to investigate these graphs because their cores must be symmetric graphs with jV (Γ∗)j = p or q. These graphs have been completely classified, and are split into three broad families, namely the circulants, the incidence graphs and the Maruˇsiˇc-Scapellato graphs. We use this classification to determine the cores of all imprimitive symmetric graphs of order pq, using differ- ent approaches for the circulants, the incidence graphs and the Maruˇsiˇc-Scapellato graphs. Circulant graphs are examples of Cayley graphs of abelian groups. Thus, we generalise the approach used to determine the cores of the symmetric circulants of order pq, and apply it to other Cayley graphs of abelian groups. Doing this, we show that if Γ is a Cayley graph of an abelian group, then Aut(Γ∗) contains a transitive subgroup generated by semiregular automorphisms, and either Γ∗ is an odd cycle or girth(Γ∗) ≤ 4.
    [Show full text]
  • Symmetric Cubic Graphs of Small Girth 1 Introduction
    Symmetric cubic graphs of small girth Marston Conder1 Roman Nedela2 Department of Mathematics Institute of Mathematics University of Auckland Slovak Academy of Science Private Bag 92019 Auckland 975 49 Bansk´aBystrica New Zealand Slovakia Email: [email protected] Email: [email protected] Abstract A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is s-regular for some s ≤ 5. We show that a symmetric cubic graph of girth at most 9 is either 1-regular or 2′-regular (following the notation of Djokovic), or belongs to a small family of exceptional graphs. On the other hand, we show that there are infinitely many 3-regular cubic graphs of girth 10, so that the statement for girth at most 9 cannot be improved to cubic graphs of larger girth. Also we give a characterisation of the 1- or 2′-regular cubic graphs of girth g ≤ 9, proving that with five exceptions these are closely related with quotients of the triangle group ∆(2, 3, g) in each case, or of the group h x,y | x2 = y3 = [x,y]4 = 1 i in the case g = 8. All the 3-transitive cubic graphs and exceptional 1- and 2-regular cubic graphs of girth at most 9 appear in the list of cubic symmetric graphs up to 768 vertices produced by Conder and Dobcs´anyi (2002); the largest is the 3-regular graph F570 of order 570 (and girth 9).
    [Show full text]
  • Integral Circulant Graphsଁ Wasin So
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 306 (2005) 153–158 www.elsevier.com/locate/disc Note Integral circulant graphsଁ Wasin So Department of Mathematics, San Jose State University, San Jose, CA 95192-0103, USA Received 10 September 2003; received in revised form 6 September 2005; accepted 17 November 2005 Available online 4 January 2006 Abstract − In this note we characterize integral graphs among circulant graphs. It is conjectured that there are exactly 2(n) 1 non-isomorphic integral circulant graphs on n vertices, where (n) is the number of divisors of n. © 2005 Elsevier B.V. All rights reserved. Keywords: Integral graph; Circulant graph; Graph spectrum 1. Graph spectra Let G be a simple graph which is a graph without loop, multi-edge, and orientation. Denote A(G) the adjacency matrix of G with respect to a given labeling of its vertices. Note that A(G) is a symmetric (0, 1)-matrix with zero diagonal entries. Adjacency matrices with respect to different labeling are permutationally similar. The spectrum of G, sp(G), is defined as the spectrum of A(G), which is the set of all eigenvalues of A(G) including multiplicity. Since the spectrum of a matrix is invariant under permutation similarity, sp(G) is independent of the labeling used in A(G). Because A(G) is a real symmetric matrix, sp(G) contains real eigenvalues only. Moreover, A(G) is an integral matrix and so its characteristic polynomial is monic and integral, hence its rational roots are integers.
    [Show full text]