Locally triangular graphs and normal quotients of ncubes


 Leo Lamb
 3 years ago
 Views:
Transcription
1 Locally triangular graphs and normal quotients of ncubes Joanna B. Fawcett The University of Western Australia 15 February, 2016
2 The triangular graph T n for n 2: Vertices 2subsets of {1,...,n}. Adjacency {i,j} {k,l} {i,j} {k,l} = 1.
3 The triangular graph T n for n 2: Vertices 2subsets of {1,...,n}. Adjacency {i,j} {k,l} {i,j} {k,l} = 1. A graph Γ is locally T n if for every vertex u V Γ, the graph induced by the neighbourhood Γ(u) is isomorphic to T n.
4 The triangular graph T n for n 2: Vertices 2subsets of {1,...,n}. Adjacency {i,j} {k,l} {i,j} {k,l} = 1. A graph Γ is locally T n if for every vertex u V Γ, the graph induced by the neighbourhood Γ(u) is isomorphic to T n. vs A rectagraph is a connected trianglefree graph in which any 2arc lies in a unique quadrangle.
5 The triangular graph T n for n 2: Vertices 2subsets of {1,...,n}. Adjacency {i,j} {k,l} {i,j} {k,l} = 1. A graph Γ is locally T n if for every vertex u V Γ, the graph induced by the neighbourhood Γ(u) is isomorphic to T n. vs A rectagraph is a connected trianglefree graph in which any 2arc lies in a unique quadrangle. e.g., the ncube Q n for n 1: Vertices F n 2. Adjacency x,y F n 2 differing in exactly one coordinate.
6 The triangular graph T n for n 2: Vertices 2subsets of {1,...,n}. Adjacency {i,j} {k,l} {i,j} {k,l} = 1. A graph Γ is locally T n if for every vertex u V Γ, the graph induced by the neighbourhood Γ(u) is isomorphic to T n. e.g., the halved ncube 1 2 Q n for n 2. vs A rectagraph is a connected trianglefree graph in which any 2arc lies in a unique quadrangle. e.g., the ncube Q n for n 1: Vertices F n 2. Adjacency x,y F n 2 differing in exactly one coordinate.
7 Lemma (Neumaier, 1985) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of an nvalent bipartite rectagraph with c 3 = 3.
8 Lemma (Neumaier, 1985) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of an nvalent bipartite rectagraph with c 3 = 3. Goal: refine this result using groups!
9 Let K Aut(Q n ). The normal quotient (Q n ) K has Vertices {x K : x F n 2 }. Adjacency x K y K (distinct) x x K,y y K such that x y in Q n.
10 Let K Aut(Q n ). The normal quotient (Q n ) K has Vertices {x K : x F n 2 }. Adjacency x K y K (distinct) x x K,y y K such that x y in Q n. Let K Aut(Q n ). The minimum distance of K is { min{dqn (x,x d K := k ) : x VQ n,k K \ {1}} if K 1, otherwise. (Matsumoto, 1991)
11 Let K Aut(Q n ). The normal quotient (Q n ) K has Vertices {x K : x F n 2 }. Adjacency x K y K (distinct) x x K,y y K such that x y in Q n. Let K Aut(Q n ). The minimum distance of K is { min{dqn (x,x d K := k ) : x VQ n,k K \ {1}} if K 1, otherwise. (Matsumoto, 1991) Generalises minimum distance for binary linear codes C F n 2 :
12 Let K Aut(Q n ). The normal quotient (Q n ) K has Vertices {x K : x F n 2 }. Adjacency x K y K (distinct) x x K,y y K such that x y in Q n. Let K Aut(Q n ). The minimum distance of K is { min{dqn (x,x d K := k ) : x VQ n,k K \ {1}} if K 1, otherwise. (Matsumoto, 1991) Generalises minimum distance for binary linear codes C F n 2 : c C = d Qn (x,x c ) = d Qn (x,x + c) = c.
13 In a graph Γ, for u,v V Γ such that d Γ (u,v) = i, define a i (u,v) := Γ i (u) Γ(v) c i (u,v) := Γ i 1 (u) Γ(v).
14 In a graph Γ, for u,v V Γ such that d Γ (u,v) = i, define a i (u,v) := Γ i (u) Γ(v) c i (u,v) := Γ i 1 (u) Γ(v). Write a i and c i when there is no dependence on the choice of u,v.
15 In a graph Γ, for u,v V Γ such that d Γ (u,v) = i, define a i (u,v) := Γ i (u) Γ(v) c i (u,v) := Γ i 1 (u) Γ(v). Write a i and c i when there is no dependence on the choice of u,v. Theorem (F., 2016) Let K Aut(Q n ). Let l 1. The following are equivalent. (i) (Q n ) K is nvalent with a i 1 = 0 and c i = i for 1 i l. (ii) d K 2l + 1.
16 In a graph Γ, for u,v V Γ such that d Γ (u,v) = i, define a i (u,v) := Γ i (u) Γ(v) c i (u,v) := Γ i 1 (u) Γ(v). Write a i and c i when there is no dependence on the choice of u,v. Theorem (F., 2016) Let K Aut(Q n ). Let l 1. The following are equivalent. (i) (Q n ) K is nvalent with a i 1 = 0 and c i = i for 1 i l. (ii) d K 2l + 1. In particular, the following are equivalent for a graph Π. (i) Π is an nvalent rectagraph with a 2 = 0 and c 3 = 3. (ii) Π (Q n ) K for some K Aut(Q n ) such that d K 7.
17 Theorem (F., 2016) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of (Q n ) K for some K Aut(Q n ) such that K is even and d K 7.
18 Theorem (F., 2016) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of (Q n ) K for some K Aut(Q n ) such that K is even and d K 7. K is even precisely when (Q n ) K is bipartite.
19 Theorem (F., 2016) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of (Q n ) K for some K Aut(Q n ) such that K is even and d K 7. K is even precisely when (Q n ) K is bipartite. K acts semiregularly on F n 2 ; in particular K is a 2group.
20 Theorem (F., 2016) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of (Q n ) K for some K Aut(Q n ) such that K is even and d K 7. K is even precisely when (Q n ) K is bipartite. K acts semiregularly on F n 2 ; in particular K is a 2group. K is unique up to conjugacy in Aut(Q n ).
21 Theorem (F., 2016) Let Γ be a graph. Let n 2. The following are equivalent. (i) Γ is a connected locally T n graph. (ii) Γ is a halved graph of (Q n ) K for some K Aut(Q n ) such that K is even and d K 7. K is even precisely when (Q n ) K is bipartite. K acts semiregularly on F n 2 ; in particular K is a 2group. K is unique up to conjugacy in Aut(Q n ). Aut(Γ) = N En :S n (K)/K where E n = {c F n 2 : c 0 mod 2}.
22 If C F n 2 and d C 2, then (Q n ) C has isomorphic halved graphs.
23 If C F n 2 and d C 2, then (Q n ) C has isomorphic halved graphs. Does this generalise to K Aut(Q n ) with d K 2?
24 If C F n 2 and d C 2, then (Q n ) C has isomorphic halved graphs. Does this generalise to K Aut(Q n ) with d K 2? No: When n = 8, even K Aut(Q n ) with K Q 8 and d K = 4, but the halved graphs of (Q n ) K are regular with different valencies.
25 If C F n 2 and d C 2, then (Q n ) C has isomorphic halved graphs. Does this generalise to K Aut(Q n ) with d K 2? No: When n = 8, even K Aut(Q n ) with K Q 8 and d K = 4, but the halved graphs of (Q n ) K are regular with different valencies. Proposition Let K Aut(Q n ) be even where d K 2. If n is odd, then (Q n ) K has isomorphic halved graphs.
26 If C F n 2 and d C 2, then (Q n ) C has isomorphic halved graphs. Does this generalise to K Aut(Q n ) with d K 2? No: When n = 8, even K Aut(Q n ) with K Q 8 and d K = 4, but the halved graphs of (Q n ) K are regular with different valencies. Proposition Let K Aut(Q n ) be even where d K 2. If n is odd, then (Q n ) K has isomorphic halved graphs. What about n even? And if d K 7?
arxiv: v1 [math.co] 1 Jan 2019
ARCTRANSITIVE 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 arctransitive
More informationA characterization of graphs by codes from their incidence matrices
A characterization of graphs by codes from their incidence matrices Peter Dankelmann Department of Mathematics University of Johannesburg P.O. Box 54 Auckland Park 006, South Africa Jennifer D. Key pdankelmann@uj.ac.za
More informationQuotients of vertextransitive graphs
Chapter 5 Quotients of vertextransitive graphs This chapter will study some operations on vertextransitive graphs. 5.1 Quotient graphs Let Γ = (V,E) be a digraph. For a partition B of V,thequotient Γ
More informationNormal and nonnormal Cayley graphs arising from generalised quadrangles
Normal and nonnormal Cayley graphs arising from generalised quadrangles Michael Giudici joint work with John Bamberg Centre for the Mathematics of Symmetry and Computation Beijing Workshop on Group Actions
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 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 information8th PhD Summer School in Discrete Mathematics Vertextransitive graphs and their local actions II
8th PhD Summer School in Discrete Mathematics Vertextransitive graphs and their local actions II Gabriel Verret g.verret@auckland.ac.nz The University of Auckland Rogla 3 July 2018 Vertexstabilisers
More information2arctransitive digraphs
2arctransitive digraphs Michael Giudici Centre for the Mathematics of Symmetry and Computation Groups St Andrews Birmingham, August 2017 on joint work with Cai Heng Li and Binzhou Xia Graphs and digraphs
More information1 Introductory remarks Throughout this paper graphs are nite, simple and undirected. Adopting the terminology of Tutte [11], a karc in a graph X is a
ON 2ARCTRANSITIVE 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
More informationThis document is downloaded from DRNTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DRNTU, Nanyang Technological University Library, Singapore. Title Multiple extensions of generalized hexagons related to the simple groups McL and Co3. Author(s) Cuypers,
More informationA Questionable DistanceRegular Graph
A Questionable DistanceRegular Graph Rebecca Ross Abstract In this paper, we introduce distanceregular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationSome Notes on DistanceTransitive and DistanceRegular Graphs
Some Notes on DistanceTransitive and DistanceRegular Graphs Robert Bailey February 2004 These are notes from lectures given in the Queen Mary Combinatorics Study Group on 13th and 20th February 2004,
More informationAutomorphism group of the balanced hypercube
Abstract Also available at http://amcjournal.eu ISSN 18553966 (printed edn.), ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 12 (2017) 145 154 Automorphism group of the balanced hypercube
More informationON THE ORDER OF ARCSTABILISERS IN ARCTRANSITIVE GRAPHS, II
Bull. Aust. Math. Soc. 87 (2013), 441 447 doi:10.1017/s0004972712000470 ON THE ORDER OF ARCSTABILISERS IN ARCTRANSITIVE GRAPHS, II GABRIEL VERRET (Received 30 April 2012; accepted 11 May 2012; first
More informationSemiregular automorphisms of vertextransitive graphs
Semiregular automorphisms of vertextransitive graphs Michael Giudici http://www.maths.uwa.edu.au/ giudici/research.html Semiregular automorphisms A semiregular automorphism of a graph is a nontrivial
More informationCodes from lattice and related graphs, and permutation decoding
Codes from lattice and related graphs, and permutation decoding J. D. Key School of Mathematical Sciences University of KwaZuluNatal Pietermaritzburg 3209, South Africa B. G. Rodrigues School of Mathematical
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution
More informationarxiv: v1 [math.co] 19 Nov 2016
Tetravalent 2transitive 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 informationPermutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation
Notation Basics of permutation group theory Arctransitive graphs Primitivity Normal subgroups of primitive groups Permutation Groups John Bamberg, Michael Giudici and Cheryl Praeger Centre for the Mathematics
More informationOn nonbipartite distanceregular graphs with valency k and smallest eigenvalue not larger than k/2
On nonbipartite distanceregular graphs with valency k and smallest eigenvalue not larger than k/2 J. Koolen School of Mathematical Sciences USTC (Based on joint work with Zhi Qiao) CoCoA, July, 2015
More informationApplying block intersection polynomials to study graphs and designs
Applying block intersection polynomials to study graphs and designs Leonard Soicher Queen Mary University of London CoCoA15, Colorado State University, Fort Collins, July 2015 Leonard Soicher (QMUL) Block
More informationOutcolourings of Digraphs
Outcolourings of Digraphs N. Alon J. BangJensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no outneighbourhood is monochromatic and call such a colouring an outcolouring.
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 informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More informationAlgebraically defined graphs and generalized quadrangles
Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number
More informationCLASSIFICATION OF CUBIC EDGETRANSITIVE GRAPHS OF ORDER 14p 2
Hacettepe Journal of Mathematics and Statistics Volume 41(2) (2012), 277 282 CLASSIFICATION OF CUBIC EDGETRANSITIVE GRAPHS OF ORDER 14p 2 Mehdi Alaeiyan and Mohsen Lashani Received 11:12:2010 : Accepted
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 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 informationThe power graph of a finite group, II
The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G
More informationTetravalent edgetransitive graphs of girth at most 4
Journal of Combinatorial Theory, Series B 97 (2007) 217 236 www.elsevier.com/locate/jctb Tetravalent edgetransitive graphs of girth at most 4 Primož Potočnik a,1,2, Steve Wilson b a University of Auckland,
More informationCubic Cayley Graphs and Snarks
Cubic Cayley Graphs and Snarks Klavdija Kutnar University of Primorska Nashville, 2012 Snarks A snark is a connected, bridgeless cubic graph with chromatic index equal to 4. nonsnark = bridgeless cubic
More informationCHARACTERISING CCA SYLOW CYCLIC GROUPS WHOSE ORDER IS NOT DIVISIBLE BY FOUR
CHARACTERISING CCA SYLOW CYCLIC GROUPS WHOSE ORDER IS NOT DIVISIBLE BY FOUR LUKE MORGAN, JOY MORRIS, AND GABRIEL VERRET Abstract. A Cayley graph on a group G has a natural edgecolouring. We say that such
More informationAlgebraic Properties and Panconnectivity of Folded Hypercubes
Algebraic Properties and Panconnectivity of Folded Hypercubes Meijie Ma a JunMing Xu b a School of Mathematics and System Science, Shandong University Jinan, 50100, China b Department of Mathematics,
More informationNonnegative Matrices I
Nonnegative Matrices I Daisuke Oyama Topics in Economic Theory September 26, 2017 References J. L. Stuart, Digraphs and Matrices, in Handbook of Linear Algebra, Chapter 29, 2006. R. A. Brualdi and H. J.
More informationTHE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION
THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION YAQIAO LI In this note we will prove Szemerédi s regularity lemma, and its application in proving the triangle removal lemma and the Roth s theorem on
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationArctransitive Bicirculants
1 / 27 Arctransitive 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 informationLine graphs and geodesic transitivity
Also available at http://amc.imfm.si ISSN 18553966 (printed edn.), ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 6 (2013) 13 20 Line graphs and geodesic transitivity Alice Devillers,
More informationGraphs with complete multipartite µgraphs
with complete multipartite µgraphs 1 1 Graduate School of Information Sciences Tohoku University joint work with A. Jurišić and Y. Tagami Discrete Math. 310 (2010), 1812 1819 February 6, 2012 Ghent University
More informationTwoarctransitive twovalent digraphs of certain orders
Also available at http://amcjournal.eu ISSN 18553966 (printed edn.), ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (2016) 127 146 Twoarctransitive twovalent digraphs of certain
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 informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number HongJian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 265066310 June 22, 2000 Abstract A proper vertex
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationBinary codes from rectangular lattice graphs and permutation decoding
Binary codes from rectangular lattice graphs and permutation decoding J. D. Key a,,1 P. Seneviratne a a Department of Mathematical Sciences, Clemson University, Clemson SC 29634, U.S.A. Abstract We examine
More informationRecent progress on Frobenius graphs and related topics
Recent progress on Frobenius graphs and related topics Sanming Zhou Department of Mathematics and Statistics The University of Melbourne Australia sanming@unimelb.edu.au IWONT 2011, Brussels Motivation
More informationStrongly regular graphs and the HigmanSims group. Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012
Strongly regular graphs and the HigmanSims group Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012 We introduce some well known results about permutation groups, strongly regular
More informationLinear Index Codes are Optimal Up To Five Nodes
Linear Index Codes are Optimal Up To Five Nodes Lawrence Ong The University of Newcastle, Australia March 05 BIRS Workshop: Between Shannon and Hamming: Network Information Theory and Combinatorics Unicast
More informationPacking cycles with modularity constraints
Packing cycles with modularity constraints Paul Wollan Mathematisches Seminar der Universität Hamburg Bundesstr. 55 20146 Hamburg, Germany Abstract We prove that for all positive integers k, there exists
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of pointline geometries have recently been studied in the
More informationProof of a Conjecture on Monomial Graphs
Proof of a Conjecture on Monomial Graphs Xiangdong Hou Department of Mathematics and Statistics University of South Florida Joint work with Stephen D. Lappano and Felix Lazebnik New Directions in Combinatorics
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 20080228 Abstract We show that if µ j is the jth largest Laplacian eigenvalue, and d
More informationCubic Cayley graphs and snarks
Cubic Cayley graphs and snarks University of Primorska UP FAMNIT, Feb 2012 Outline I. Snarks II. Independent sets in cubic graphs III. Nonexistence of (2, s, 3)Cayley snarks IV. Snarks and (2, s, t)cayley
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of GraphPaths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281288 ISSN 2347307X (Print) & ISSN 23473142 (Online) www.arcjournals.org On Orthogonal
More informationd 2 coloring of a Graph
d coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India Email: selva 158@yahoo.co.in Abstract A subset S of
More informationVertex subsets with minimal width and dual width
Vertex subsets with minimal width and dual width in Qpolynomial distanceregular graphs University of Wisconsin & Tohoku University February 2, 2011 Every face (or facet) of a hypercube is a hypercube...
More informationIndependent sets and repeated degrees
Independent sets repeated degrees B. Bollobás A.D. Scott Department of Pure Mathematics Mathematical Statistics, University of Cambridge, 16 Mill Lane, Cambridge, CB2 1SB, Engl. Department of Mathematics,
More informationStrongly regular graphs and Borsuk s conjecture
Seminar talk Department of Mathematics, Shanghai Jiao Tong University Strongly regular graphs and Borsuk s conjecture Andriy Bondarenko Norwegian University of Science and Technology and National Taras
More informationA Characterization of DistanceRegular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of DistanceRegular Graphs with Diameter Three EDWIN R. VAN DAM
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 informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationResearch Article Nonnormal EdgeTransitive 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 EdgeTransitive Cubic Cayley Graphs of Dihedral Groups Mehdi
More informationSemiregular automorphisms of vertextransitive cubic graphs
Semiregular automorphisms of vertextransitive 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 informationGroup Colorability of Graphs
Group Colorability of Graphs HongJian 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 nontrivial Abelian
More informationOn representable graphs
On representable graphs Sergey Kitaev and Artem Pyatkin 3rd November 2005 Abstract A graph G = (V, E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in
More information4valent graphs of order 6p 2 admitting a group of automorphisms acting regularly on arcs
Also available at http://amcjournal.eu ISSN 18553966 (printed edn.) ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 9 (2015) 1 18 4valent graphs of order 6p 2 admitting a group of automorphisms
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationQuantum Walks on Strongly Regular Graphs
Quantum Walks on Strongly Regular Graphs by Krystal J. Guo A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics
More informationFACTOR GRAPH OF NONCOMMUTATIVE RING
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 9, Issue 6, November  December 2018, pp. 178 183, Article ID: IJARET_09_06_019 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=9&itype=6
More informationChihHung Yen and HungLin Fu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 273286, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ LINEAR 2ARBORICITY OF THE COMPLETE GRAPH ChihHung Yen and HungLin
More informationA copy can be downloaded for personal noncommercial research or study, without prior permission or charge
Giudici, M., Heng Li, C., Seress, A., and Thomas, A. (2015) Characterising vertexstar transitive and edgestar transitive graphs. Israel Journal of Mathematics, 205(1), pp. 3572. Copyright 2014 Springer
More informationOn uniquely 3colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely colorable plane graphs without prescribed adjacent faces Zepeng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationOn the algorithmic aspects of Hedetniemi s conjecture
On the algorithmic aspects of Hedetniemi s conjecture Claude Tardif Royal Military College of Canada PO Box 17000 Stn Forces, Kingston, ON Canada, K7K 7B4 March 25, 2009 Keywords: Graph colourings, graph
More informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k dimensional affine space, F k 3, over F 3. A line of
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
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 informationMathathon Round 1 (2 points each)
Mathathon Round ( points each). A circle is inscribed inside a square such that the cube of the radius of the circle is numerically equal to the perimeter of the square. What is the area of the circle?
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationBulletin of the. Iranian Mathematical Society
ISSN: 1017060X (Print) ISSN: 17358515 (Online) Bulletin of the Iranian Mathematical Society Vol. 43 (2017), No. 3, pp. 951 974. Title: Normal edgetransitive Cayley graphs on the nonabelian groups of
More informationARCTRANSITIVE GRAPHS Dragan Marusic IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija
CLASSIFYING ARCTRANSITIVE 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 informationHamiltonian paths in tournaments A generalization of sorting DM19 notes fall 2006
Hamiltonian paths in tournaments A generalization of sorting DM9 notes fall 2006 Jørgen BangJensen Imada, SDU 30. august 2006 Introduction and motivation Tournaments which we will define mathematically
More informationAn Oretype Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Oretype Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationNeighbordistinguishing ktuple edgecolorings of graphs
Neighbordistinguishing ktuple edgecolorings of graphs JeanLuc Baril and Olivier Togni 1 LEI UMRCNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJONCedex France email: {barjl,olivier.togni}@ubourgogne.fr
More informationHalfarctransitive graphs of arbitrary even valency greater than 2
arxiv:150502299v1 [mathco] 9 May 2015 Halfarctransitive graphs of arbitrary even valency greater than 2 Marston DE Conder Department of Mathematics, University of Auckland, Private Bag 92019, Auckland
More informationPerfect Dominating Sets in Gaussian Graphs
Perfect Dominating Sets in Gaussian Graphs Carmen Martínez 1, Miquel Moretó 2 and Ramón Beivide 3. Abstract Gaussian Graphs are introduced and analyzed in this paper. The set of vertices of these Cayley
More informationNested Cycles in Large Triangulations and CrossingCritical Graphs
Nested Cycles in Large Triangulations and CrossingCritical Graphs César Hernández Vélez 1, Gelasio Salazar,1, and Robin Thomas,2 1 Instituto de Física, Universidad Autónoma de San Luis Potosí. San Luis
More informationLowell Dam Gone Out. Streets Turned I n t o Rivers. No Cause For Alarm Now However As This Happened 35 Years A&o
V ()\\ ))? K K Y 6 96 Y  Y Y V 5 Z ( z x z \  \   z  q q x x  x 5 9 Q \ V   Y x 59 7 x x  Y  x   x z  z x  ( 7 x V 9 z q &?  9  V ( x    V [ Z x z  x > )   > X Z z ( V V V
More informationShortest paths with negative lengths
Chapter 8 Shortest paths with negative lengths In this chapter we give a linearspace, nearly lineartime algorithm that, given a directed planar graph G with real positive and negative lengths, but no
More informationPoint regular groups of automorphisms of generalised quadrangles
Point regular groups of automorphisms of generalised quadrangles Michael Giudici joint work with John Bamberg Centre for the Mathematics of Symmetry and Computation Finite Geometries, Third Irsee Conference
More informationStrongly regular graphs and Borsuk s conjecture
Optimal Point Configurations and Orthogonal Polynomials 2017 Strongly regular graphs and Borsuk s conjecture Andriy Bondarenko Norwegian University of Science and Technology 19 April 2017 Andriy Bondarenko
More informationThe (mod, integral and exclusive) sum number of
Global Journal of Pure and Applied Mathematics. ISSN 09731768 Volume 12, Number 1 (2016), pp. 297307 Research India Publications http://www.ripublication.com The (mod, integral and exclusive) sum number
More informationBounds on the generalised acyclic chromatic numbers of bounded degree graphs
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs Catherine Greenhill 1, Oleg Pikhurko 2 1 School of Mathematics, The University of New South Wales, Sydney NSW Australia 2052,
More informationGraphs where every ksubset of vertices is an identifying set
Graphs where every ksubset of vertices is an identifying set Sylvain Gravier Svante Janson Tero Laihonen Sanna Ranto 8 January 2008 Abstract Let G = (V, E) be an undirected graph without loops and multiple
More informationFINITE HOMOGENEOUS STRUCTURES AND ARITIES OF PERMUTATION GROUPS. Contents
FINITE HOMOGENEOUS STRUCTURES AND ARITIES OF PERMUTATION GROUPS ALEKSANDER HORAWA Contents Introduction 1 1. Relational structures and homogeneity 2 2. Arities of permutation groups 4 3. Relational structures
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationA short course on matching theory, ECNU Shanghai, July 2011.
A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.
More informationNotes on Freiman s Theorem
Notes on Freiman s Theorem Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. Email: jacques@ucsd.edu. 1 Introduction Freiman s Theorem describes the
More informationClass Field Theory. Steven Charlton. 29th February 2012
Class Theory 29th February 2012 Introduction Motivating examples Definition of a binary quadratic form Fermat and the sum of two squares The Hilbert class field form x 2 + 23y 2 Motivating Examples p =
More information