DOCSLIB.ORG

GCD-Graphs and NEPS of Complete Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
GCD-Graphs and NEPS of Complete Graphs Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 6 (2013) 289–299 GCD-Graphs and NEPS of Complete Graphs Walter Klotz Institut fur¨ Mathematik, Technische Universitat¨ Clausthal, Germany Torsten Sander Fakultat¨ fur¨ Informatik, Ostfalia Hochschule fur¨ angewandte Wissenschaften, Germany Received 21 February 2012, accepted 20 August 2012, published online 19 November 2012 Abstract A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. Such graphs are known to have integral spectrum. A non-complete extended p- sum, or NEPS in short, is well-known general graph product. We show that the class of gcd-graphs and the class of NEPS of complete graphs coincide. Thus, a relation between the algebraically defined Cayley graphs and the combinatorially defined NEPS of complete graphs is established. We use this link to show that gcd-graphs have a particularly simple eigenspace structure, to be precise, that every eigenspace of the adjacency matrix of a gcd- graph has a basis with entries −1; 0; 1 only. Keywords: Integral graphs, Cayley graphs, graph products. Math. Subj. Class.: 05C25, 05C50 1 Introduction n Given a set B ⊆ f0; 1g and graphs G1;:::;Gn, the NEPS (non-complete extended p- sum) of these graphs with respect to basis B, G = NEPS(G1;:::;Gn; B), has as its vertex set the Cartesian product of the vertex sets of the individual graphs, V (G) = V (G1)×· · ·× V (Gn). Distinct vertices x = (x1; : : : ; xn); y = (y1; : : : ; yn) 2 V (G) are adjacent in G, if and only if there exists some n-tuple (β1; : : : ; βn) 2 B such that xi = yi, whenever βi = 0, and xi; yi are distinct and adjacent in Gi, whenever βi = 1. In particular, NEPS(G1; f(1)g) = G1 and NEPS(G1; ;) = NEPS(G1; f(0)g) is the graph without edges on the vertices of G1. The NEPS operation generalizes a number of known graph products, all of which have in common that the vertex set of the resulting graph is the Cartesian product of the input vertex sets. For example, NEPS(G1;:::;Gn; f(1; 1;:::; 1)g) = G1 ⊗ ::: ⊗ Gn is the E-mail addresses: [email protected] (Walter Klotz), [email protected] (Torsten Sander) Copyright c 2013 DMFA Slovenije 290 Ars Math. Contemp. 6 (2013) 289–299 product of G1;:::;Gn (cf. [10], “direct product” in [15]). As can be seen, unfortunately, the naming of graph products is not standardized at all. The “Cartesian product” of graphs in [15] is even known as the “sum” of graphs in [10]. With respect to this seemingly ar- bitrary mixing of sum and product terminology, let us point out that here the term “sum” (and also the “p-sum” contained in the NEPS acronym) indicates that the adjacency matrix of the constructed product graph arises from a certain sum of matrices (involving the adja- cency matrices of the input graphs). Refer to [10] or [11] for the history of the notion of NEPS. We remark that the NEPS operation can be generalized even further, see e.g. [12] and [21]. Next, we consider the important class of Cayley graphs [13]. These graphs have been and still are studied intensively because of their symmetry properties and their connections to communication networks, quantum physics and other areas [8], [13]. Let Γ be a finite, additive group. A subset S ⊆ Γ is called a symbol (also: connection set, shift set) of Γ if −S = {−s : s 2 Sg = S, 0 62 S. The undirected Cayley graph over Γ with symbol S, denoted by Cay(Γ;S), has vertex set Γ; two vertices a; b 2 Γ are adjacent if and only if a − b 2 S. Let us now construct the class of gcd-graphs. The greatest common divisor of non- negative integers a and b is denoted by gcd(a; b), gcd(0; b) = gcd(b; 0) = b. If x = (x1; : : : ; xr) and m = (m1; :::; mr) are tuples of nonnegative integers, then we set gcd(x; m) = (d1; : : : ; dr) = d; di = gcd(xi; mi) for i = 1; : : : ; r: For an integer n ≥ 1 we denote by Zn the additive group of integers modulo n, the ring of integers modulo n, or simply the set f0; 1; : : : ; n − 1g. The particular choice will be clear from the context. Let Γ be an (additive) finite abelian group represented as a direct sum of cyclic groups, Γ = Zm1 ⊕ ::: ⊕ Zmr ; mi ≥ 1 for i = 1; : : : ; r: Suppose that di is a divisor of mi; 1 ≤ di ≤ mi, for i = 1; : : : ; r. For the divisor tuple d = (d1; : : : ; dr) of m = (m1; : : : ; mr) we define SΓ(d) = fx = (x1; : : : ; xr) 2 Γ : gcd(x; m) = dg: Let D = fd(1); : : : ; d(k)g be a set of distinct divisor tuples of m and define k [ (j) SΓ(D) = SΓ(d ): j=1 Observe that the union is actually disjoint. The sets SΓ(D) shall be called gcd-sets of Γ. We define the class of gcd-graphs as the Cayley graphs Cay(Γ;S) over a finite abelian group Γ with symbol S a gcd-set of Γ. The most prominent members of this class are perhaps the unitary Cayley graphs Xn = Cay(Zn;Un), where Un = SZn (1) is the multiplicative group of units of Zn (cf. [16], [17], [22]). The main goal of this paper is to show in Section2 that every gcd-graph is isomorphic to a NEPS of complete graphs. Conversely, every NEPS of complete graphs is isomorphic to a gcd-graph over some abelian group. This relation is remarkable since it allows us to define gcd-graphs either algebraically (via Cayley graphs) or purely combinatorially (via NEPS). The characterization of gcd-graphs as NEPS of complete graphs reveals some new access to structural properties of gcd-graphs. As a first application, we show in Section W. Klotz and T. Sander : GCD-Graphs and NEPS of Complete Graphs 291 3 that every gcd-graph has simply structured eigenspace bases for all of its eigenvalues. This means that for every eigenspace a basis can be found whose vectors only have entries from the set f0; 1; −1g. It is known that other graph classes exhibit a similar eigenspace structure, although not necessarily for all of their eigenspaces [9], [20], [25]. Finally, we present some open problems in Section4. 2 Isomorphisms between NEPS of complete graphs and gcd-graphs We are going to show in several steps that gcd-graphs and NEPS of complete graphs are the same. Lemma 2.1. Let Γ = Zm1 ⊕ · · · ⊕ Zmr and d = (d1; : : : ; dr) a tuple of positive divisors r of m = (m1; : : : ; mr). Define b = (bi) 2 f0; 1g by ( 1 if di < mi; bi = 0 if di = mi: Then we have Cay(Γ;S (d)) = NEPS(Cay(Z ;S (d ));:::; Cay(Z ;S (d )); fbg): Γ m1 Zm1 1 mr Zmr r Proof. Both Cay(Γ;SΓ(d)) and the above NEPS have the same vertex set Γ. It remains to show that they have the same edge set. Let x; y 2 Γ with x = (x1; : : : ; xr), y = (y1; : : : ; yr) and suppose that x 6= y. Now x and y are adjacent in Cay(Γ;SΓ(d)) if and only if gcd(xi − yi; mi) = di for i = 1; : : : ; r. The latter condition means that in case di < mi the vertices xi and yi are adjacent in G = Cay(Z ;S (d )), and in case d = m we have x = y . But this is exactly the i mi Zmi i i i i i condition for adjacency of x and y in NEPS(G1;:::;Gr; fbg). The following lemma allows us to break down the Cayley graphs that form the factors of the NEPS mentioned in Lemma 2.1. Each factor can be transformed into a gcd-graph over a product of cyclic groups of prime power order. Using Lemma 2.1 once again, we obtain a representation of the original graph as a NEPS of NEPS of gcd-graphs over cyclic groups of prime power order. Lemma 2.2. Let the integer m ≥ 2 and a proper divisor d ≥ 1 of m be given as products of powers of distinct primes, r Y αi m = mi; mi = pi ; αi > 0 for i = 1; : : : ; r; i=1 r Y βi d = di; di = pi ; 0 ≤ βi ≤ αi for i = 1; : : : ; r: i=1 ~ If we set Γ = Zm1 ⊕ · · · ⊕ Zmr and d = (d1; : : : ; dr), then there exists an isomorphism ~ Cay(Zm;SZm (d)) ' Cay(Γ;SΓ(d)): 292 Ars Math. Contemp. 6 (2013) 289–299 Proof. By the Chinese remainder theorem [23] we know that every z 2 Zm is uniquely determined by the congruences z ≡ zi mod mi; zi 2 Zmi for i = 1; : : : ; r: This gives rise to a bijection Zm ! Γ by virtue of z 7! (z1; : : : ; zr) =:z ~. We show that ~ this bijection induces an isomorphism between Cay(Zm;SZm (d)) and Cay(Γ;SΓ(d)). ~ Let x; y 2 Zm, x 6= y. Note that x~ and y~ are vertices of Cay(Γ;SΓ(d)). The vertices x and y are adjacent in Cay(Zm;SZm (d)) if and only if gcd(x−y; m) = d. This is equivalent ~ to gcd(xi − yi; mi) = di for every i = 1; : : : ; r. Now this means gcd(~x − y;~ m~ ) = d, with ~ m~ = (m1; : : : ; mr), which is the condition for adjacency of x~ and y~ in Cay(Γ;SΓ(d)). Next we shall prove a lemma that helps us consolidate the nesting of NEPS operations into a single NEPS operation.
Load more

Recommended publications
  • Integral Free-Form Sudoku Graphs
    Integral Free-Form Sudoku graphs Omar Alomari 1 Basic Sciences German Jordanian University Amman, Jordan Mohammad Abudayah 2 Basic Sciences German Jordanian University Amman, Jordan Torsten Sander 3 Fakulta¨t fu¨r Informatik Ostfalia Hochschule fu¨r angewandte Wissenschaften Wolfenbu¨ttel, Germany Abstract A free-form Sudoku puzzle is a square arrangement of m × m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1; : : : m in the cells such that the numbers in every row, column and block are distinct. Represent each cell by a vertex and add edges between two vertices exactly when the corresponding cells, according to the rules, must contain different numbers. This yields the associated free-form Sudoku graph. It was shown that all Sudoku graphs are integral graphs, in this paper we present many free-form Sudoku graphs that are still integral graphs. Keywords: Sudoku, spectrum, eigenvectors. 1 Preliminaries The r−regular slice n−sudoku puzzle is the free-form sudoku puzzle obtained from the n−sudoku puzzle by shifting the block cells in the (in + d)th row (d − 1)rn cells to the right, where 1 ≤ d ≤ n. In Figure 1 (B), the cells are partitioned into 9 blocks denoted by Bi . To study the eigenvalues of r−regular slice n−sudoku, let us start from the n2 ×n rectangular template slice where its cells partitioned into n2 blocks and for i = 0; 1; : : : ; n − 1, rows in + 1; in + 2;::: (i + 1)n contains only the n block numbers in + 1; in + 2;::: (i + 1)n, with the additional restriction that the block numbers used in different i−collection of rows are distinct, see fig1 (A).
    [Show full text]
  • Spectral Graph Theory – from Practice to Theory
    Spectral Graph Theory – From Practice to Theory Alexander Farrugia [email protected] Abstract Graph theory is the area of mathematics that studies networks, or graphs. It arose from the need to analyse many diverse network-like structures like road networks, molecules, the Internet, social networks and electrical networks. In spectral graph theory, which is a branch of graph theory, matrices are constructed from such graphs and analysed from the point of view of their so-called eigenvalues and eigenvectors. The first practical need for studying graph eigenvalues was in quantum chemistry in the thirties, forties and fifties, specifically to describe the Hückel molecular orbital theory for unsaturated conjugated hydrocarbons. This study led to the field which nowadays is called chemical graph theory. A few years later, during the late fifties and sixties, graph eigenvalues also proved to be important in physics, particularly in the solution of the membrane vibration problem via the discrete approximation of the membrane as a graph. This paper delves into the journey of how the practical needs of quantum chemistry and vibrating membranes compelled the creation of the more abstract spectral graph theory. Important, yet basic, mathematical results stemming from spectral graph theory shall be mentioned in this paper. Later, areas of study that make full use of these mathematical results, thus benefitting greatly from spectral graph theory, shall be described. These fields of study include the P versus NP problem in the field of computational complexity, Internet search, network centrality measures and control theory. Keywords: spectral graph theory, eigenvalue, eigenvector, graph. Introduction: Spectral Graph Theory Graph theory is the area of mathematics that deals with networks.
    [Show full text]
  • NUMBER THEORY and COMBINATORICS SEMINAR UNIVERSITY of LETHBRIDGE Contents
    PAST SPEAKERS IN THE NUMBER THEORY AND COMBINATORICS SEMINAR OF THE DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE AT THE UNIVERSITY OF LETHBRIDGE http://www.cs.uleth.ca/~nathanng/ntcoseminar/ Organizers: Nathan Ng and Dave Witte Morris (starting Fall 2011) Amir Akbary (Fall 2007 – Fall 2010) Contents ........................... Fall 2020 2 Spring 2014 ....................... 48 ........................ Spring 2020 5 Fall 2013 .......................... 52 ........................... Fall 2019 9 Spring 2013 ....................... 55 ....................... Spring 2019 12 Fall 2012 .......................... 59 .......................... Fall 2018 16 Spring 2012 ....................... 63 ....................... Spring 2018 20 Fall 2011 .......................... 67 .......................... Fall 2017 24 Fall 2010 .......................... 70 ....................... Spring 2017 28 Spring 2010 ....................... 71 .......................... Fall 2016 31 Fall 2009 .......................... 73 ....................... Spring 2016 34 Spring 2009 ....................... 75 .......................... Fall 2015 39 Fall 2008 .......................... 77 ....................... Spring 2015 42 Spring 2008 ....................... 80 .......................... Fall 2014 45 Fall 2007 .......................... 83 Fall 2020 Open problem session Sep 28, 2020 Please bring your favourite (math) problems. Anyone with a problem to share will be given about 5 minutes to present it. We will also choose most of the speakers for the rest of the semester.
    [Show full text]
  • Finite Geometry and Combinatorial Applications
    Finite Geometry and Combinatorial Applications Anurag Bishnoi Preface Incidence geometry is the study of abstract structures satisfying certain geometric axioms inspired from the incidence properties of points, lines, planes, etc. For example, the axiom that through any two points there is a unique line, or that any two lines intersect in at most one point. In this course we will introduce several finite incidence structures and explore how these structures interact with combinatorics. In particular, we will study finite projective and affine spaces, generalized polygons and polar spaces. On the combinatorial side we will study Latin squares, blocking sets, strongly regular graphs, finite field Kakeya and Nikodym problems, etc. Recommended Reading References for the course • “Finite Geometry and Combinatorial Applications” by Simeon Ball. • “An Introduction to Incidence Geometry” by Bart De Bruyn. • “Incidence Geometry” by G. Eric Moorhouse, http://math.ucr.edu/home/baez/ qg-fall2016/incidence_geometry.pdf. • “Projective Geometry” by Rey Casse. • “Algebraic Graph Theory” by Chris Godsil and Gordon Royle. Further reading • “Finite Geometries” by P. Dembowski. • “Points and Lines” by E. Shult. • “Projective Geometries over finite fields” by Hirschfeld and Thas. • “Foundations of Incidence Geometry” by Johannes Ueberberg. • “Projective Geometry: From Foundations to Applications” by Albrecht Beutelspacher and Ute Rosenbaum. • “Combinatorics of finite geometries” by Lynn Margaret Batten. • “Distance Regular Graphs” by Brouwer, Cohen and Neumaier. • “Designs, Graphs, Codes and their Links” by Peter J. Cameron and J. H. van Lint. • “Spectra of Graphs” by Brouwer and Haemers. Page iii Background required 1 Linear Algebra The reader should be familiar with the following notions from linear algebra: vector spaces over a field, linear independence, span, basis of a vector space, the lattice of subspaces, linear maps between vector spaces, linear forms, dual spaces, ranks of matrices, determinants, quotient spaces, eigenvalues and eigenspaces.
    [Show full text]
  • Spectrum of Free-Form Sudoku Graphs
    Open Math. 2018; 16:1445–1454 Open Mathematics Research Article Mohammad Abudayah, Omar Alomari, and Torsten Sander* Spectrum of free-form Sudoku graphs https://doi.org/10.1515/math-2018-0125 Received August 30, 2018; accepted November 26, 2018 Abstract: A free-form Sudoku puzzle is a square arrangement of m × m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1, ... , m in the cells such that the numbers in every row, column and block are distinct. Represent each cell by a vertex and add edges between two vertices exactly when the corresponding cells, according to the rules, must contain dierent numbers. This yields the associated free-form Sudoku graph. This article studies the eigenvalues of free-form Sudoku graphs, most notably integrality. Further, we analyze the evolution of eigenvalues and eigenspaces of such graphs when the associated puzzle is subjected to a ‘blow up’ operation, which scales the cell grid including its block partition. Keywords: Sudoku, Spectrum, Eigenvectors MSC: 05C50, 15A18 1 Introduction The recreational game of Sudoku has been popular for several years now. Its classic variant is played on a board with 9 × 9 cells, subdivided into a 3 × 3 grid of square blocks containing 3 × 3 cells each. Each cell may be empty or contain one of the numbers 1, ... , 9. A number of cells of each puzzle will have been pre-lled by the puzzle creator. The goal of the puzzle solver is to ll the remaining cells with the numbers 1, ..
    [Show full text]
  • Counting and Coloring Sudoku Graphs
    Portland State University PDXScholar Mathematics and Statistics Dissertations and Fariborz Maseeh Department of Mathematics Theses and Statistics Winter 2019 Counting and Coloring Sudoku Graphs Kyle Oddson Portland State University, [email protected] Follow this and additional works at: https://pdxscholar.library.pdx.edu/mth_grad Part of the Algebra Commons, Probability Commons, Statistical Models Commons, and the Statistical Theory Commons Let us know how access to this document benefits ou.y Recommended Citation Oddson, Kyle, "Counting and Coloring Sudoku Graphs" (2019). Mathematics and Statistics Dissertations and Theses. 1. https://pdxscholar.library.pdx.edu/mth_grad/1 This Thesis is brought to you for free and open access. It has been accepted for inclusion in Mathematics and Statistics Dissertations and Theses by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Counting and Coloring Sudoku Graphs Kyle Oddson Under the direction of Dr. John Caughman with second reader Dr. Sean Larsen Mathematical literature project in partial fulfillment of requirements for the Master of Science in Mathematics Fariborz Maseeh Department of Mathematics and Statistics Portland State University Winter 2019 Abstract A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 { 9 with no repetition in any row, column, or box. We generalize the 2 2 ≥2 notion of the n × n sudoku grid for all n 2 Z and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n; we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of the sudoku graph; we show that sudoku graphs are Cayley graphs for the direct product group Zn × Zn × Zn × Zn; and we find the automorphism group of the sudoku graph.
    [Show full text]
  • Spectrum of Free-Form Sudoku Graphs
    Spectrum of free-form Sudoku graphs (Extended preprint) Mohammad Abudayah Omar Alomari [email protected] [email protected] German Jordanian University Amman, Jordan Torsten Sander∗ [email protected] Fakult¨at f¨ur Informatik, Ostfalia Hochschule f¨ur angewandte Wissenschaften Wolfenb¨uttel, Germany August 21, 2018 Abstract A free-form Sudoku puzzle is a square arrangement of m × m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1,...,m in the cells such that the numbers in every row, column and block are distinct. Represent each cell by arXiv:1808.06375v1 [math.CO] 20 Aug 2018 a vertex and add edges between two vertices exactly when the corresponding cells, according to the rules, must contain different numbers. This yields the associated free-form Sudoku graph. This article studies the eigenvalues of free-form Sudoku graphs, most notably integrality. Further, we analyze the evolution of eigenvalues and eigenspaces of such graphs when the associated puzzle is subjected to a ‘blow up’ operation, scaling the cell grid including its block partition. ∗Corresponding author 1 INTRODUCTION 2 8 4 5 6 1 9 2 7 3 1 6 7 3 4 2 9 8 5 2 3 9 8 7 5 4 1 6 9 2 4 1 3 8 5 6 7 3 7 1 2 5 6 8 4 9 6 5 8 4 9 7 1 3 2 5 1 6 7 2 4 3 9 8 4 8 2 9 6 3 7 5 1 7 9 3 5 8 1 6 2 4 Figure 1: Example Sudoku puzzle Keywords: Sudoku, spectrum, eigenvectors 2010 Mathematics Subject Classification: Primary 05C50, Secondary 15A18 1 Introduction The recreational game of Sudoku has been popular for several years now.
    [Show full text]
  • Counting and Coloring Sudoku Graphs
    Counting and Coloring Sudoku Graphs Kyle Oddson Under the direction of Dr. John Caughman with second reader Dr. Sean Larsen Mathematical literature project in partial fulfillment of requirements for the Master of Science in Mathematics Fariborz Maseeh Department of Mathematics and Statistics Portland State University Winter 2019 Abstract A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 { 9 with no repetition in any row, column, or box. We generalize the 2 2 ≥2 notion of the n × n sudoku grid for all n 2 Z and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n; we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of the sudoku graph; we show that sudoku graphs are Cayley graphs for the direct product group Zn × Zn × Zn × Zn; and we find the automorphism group of the sudoku graph. In the subsequent section, we find and prove several graph theoretic properties for this class of graphs, and we offer some conjectures on these and other properties. i Contents 1 Introduction 1 2 Definitions 2 Sudoku Board . 2 Band, Stack . 2 Sudoku Graph . 2 Canonical Labeling . 3 Box Identification . 4 Adjacencies of Sn ...................................... 5 Classification . 5 3 Main Results 6 Chromatic Number . 6 Graph product remarks . 9 Union of graph products structure of Sn ......................... 9 Cayley Graph . 11 Symmetries and Automorphisms . 17 Automorphism Group of Sn ...............................
    [Show full text]
  • 22Nd British Combinatorial Conference University of St
    22nd British Combinatorial Conference University of St Andrews 5th – 10th July 2009 Monday 6th July Time Theatre A Theatre B Theatre C Theatre D Room 314 Room 204 09:00 – 09:30 Welcome & registration 09:30 – 10:30 Cameron (p. 6) — — — — — 10:30 – 11:00 Coffee 11:00 – 11:20 Alderson (p. 7) Kisielewicz (p. 7) Yamashita (p. 7) Tsikouras (p. 8) Poghosyan (p. 8) — 11:25 – 11:45 FIRE!! FIRE!! FIRE!! FIRE!! FIRE!! — 11:50 – 12:10 FIRE!! FIRE!! FIRE!! FIRE!! FIRE!! — 12:15 – 12:35 FIRE!! FIRE!! FIRE!! FIRE!! FIRE!! — 12:40 – 14:00 Lunch 14:00 – 15:00 Noy (p. 9) — — — — — 15:05 – 15:25 Kochol (p. 10) Bailey (Rob.) (p. 10) Burger (p. 10) Abreu (p. 11) Lin (p. 11) 15:30 – 15:50 Kayibi (p. 12) Balof (p. 12) Chang (p. 12) Blackburn (p. 13) Lo (p. 13) — 15:55 – 16:20 Tea 16:20 – 16:40 Ivanov (p. 14) Lopez (p. 15) Drapal (p. 15) Tsuchiya (p. 16) Whitty (p. 16) — 16:45 – 17:05 Ivanov (p. 14) Miralles (p. 17) Egan (p. 17) Mitjana (p. 18) Suarez (p. 18) — 17:10 – 17:30 Ivanov (p. 14) Montagh (p. 19) Ellingham (p. 19) Montejano (p. 20) Wu (p. 20) — 17:35 – 17:55 Smith (p. 21) Arumugam (p. 21) de Bruyn (p. 21) Lichiardopol (p. 22) — 2 Tuesday 7th July Time Theatre A Theatre B Theatre C Theatre D Room 314 Room 204 09:30 – 10:30 Riordan (p. 23) — — — — — 10:30 – 11:00 Coffee 11:00 – 11:20 Santos (p. 24) Dalfo (p.
    [Show full text]
  • Eigenvalues of Cayley Graphs
    Eigenvalues of Cayley graphs Xiaogang Liu Department of Applied Mathematics Northwestern Polytechnical University Xi’an, Shaanxi 710072, P. R. China [email protected] Sanming Zhou School of Mathematics and Statistics The University of Melbourne Parkville, VIC 3010, Australia [email protected] January 22, 2019 Abstract We survey some of the known results on eigenvalues of Cayley graphs and their applica- tions, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs. Keywords: Spectrum of a graph; Eigenvalues of a graph; Cayley graphs; Integral graphs; Energy of a graph; Ramanujan graph; Second largest eigenvalue of a graph; Distance-regular graphs; Strongly regular graphs; Perfect state transfer AMS Subject Classification (2010): 05C50, 05C25 Contents 1 Introduction 4 1.1 Outlineofthepaper ............................... ... 5 1.2 Terminologyandnotation . ..... 7 arXiv:1809.09829v2 [math.CO] 22 Jan 2019 2 Eigenvalues of Cayley graphs 9 2.1 Characters...................................... 9 2.2 EigenvaluesofCayleygraphs . ...... 10 2.3 Eigenvalues of vertex-transitive graphs . ............ 12 3 Integral Cayley graphs 13 3.1 Characterizations of integral Cayley graphs . ............ 13 3.1.1 Integral circulant graphs, unitary Cayley graphs, and gcd graphs . 13 3.1.2 Integral Cayley graphs on abelian groups . ....... 15 1 3.1.3 IntegralnormalCayleygraphs . 16 3.1.4 Integral Cayley multigraphs . ..... 16 3.2 A few families of integral Cayley graphs on abelian groups............. 18 3.2.1 Unitary finite Euclidean graphs . ..... 18 3.2.2 NEPS of complete graphs, gcd graphs of abelian groups, and generalized Hamminggraphs................................ 19 3.2.3 Sudoku graphs and positional Sudoku graphs . ....... 20 3.2.4 Pandiagonal Latin square graphs .
    [Show full text]
  • Program of the Sessions San Diego, California, January 10–13, 2018
    Program of the Sessions San Diego, California, January 10–13, 2018 Monday, January 8 AMS Short Course Reception AMS Short Course on Discrete Differential 5:00 PM –6:00PM Room 5B, Upper Level, Geometry, Part I San Diego Convention Center 8:00 AM –5:00PM Room 5A, Upper Level, San Diego Convention Center 8:00AM Introduction & Overview Tuesday, January 9 8:30AM Discrete Laplace operators - theory. (1) Max Wardetzky, University of Goettingen AMS Short Course on Discrete Differential 9:30AM Break Geometry, Part II 9:50AM Discrete Laplace operators - applications. (2) Max Wardetzky, University of Goettingen 8:00 AM –5:00PM Room 5A, Upper Level, San Diego Convention Center 10:50AM Break 11:10AM Discrete parametric surfaces - theory. 8:00AM Discrete mappings - theory. (3) Johannes Wallner,TUGraz (5) Yaron Lipman, Weizmann Institute of 12:10PM Lunch Science 1:30PM Discrete parametric surfaces - 9:00AM Break (4) applications. 9:20AM Discrete mappings - applications. Johannes Wallner,TUGraz (6) Yaron Lipman, Weizmann Institute of 2:30PM Free Time Science 3:30PM Demo Session 10:20AM Break 10:40AM Discrete conformal geometry - theory. NSF-EHR Grant Proposal Writing Workshop (7) Keenan Crane,CarnegieMellon University 3:00 PM –6:00PM Coronado Room, 4th Floor, 11:40AM Lunch South Tower, Marriott Marquis San Diego Marina 1:00PM Discrete conformal geometry - Organizers: Ron Buckmire,National (8) applications. Science Foundation Keenan Crane,CarnegieMellon Lee Zia, National Science University Foundation 2:00PM Break The time limit for each AMS contributed paper in the sessions meeting will be found in Volume 39, Issue 1 of Abstracts is ten minutes. The time limit for each MAA contributed of papers presented to the American Mathematical Society, paper varies.
    [Show full text]
  • Gap-Published.Pdf
    This list contains citations of the GAP system in scientific works. It has been obtained from author’s notices and searches in scientific citation databases including MathSciNet, for which we acknowledge the American Mathematical Society. Published work which cites GAP [1] M. Abas and T. Vetr´ık. Metric dimension of Cayley digraphs of split metacyclic groups. Theoret. Comput. Sci., 809:61–72, 2020. [2] A. Abbas, A. Assi, and P. A. Garc´ıa-S´anchez. Canonical bases of modules over one di- mensional K-algebras. Rev. R. Acad. Cienc. Exactas F´ıs. Nat. Ser. A Mat. RACSAM, 113(2):1121–1139, 2019. [3] I. Abdeljaouad. Calculation of primitive invariants of finite groups. RAIRO-INF THEOR APPL, 33(1):59–77, 1999. [4] A. Abdolghafourian and M. A. Iranmanesh. Divisibility graph for symmetric and alternating groups. Comm. Algebra, 43(7):2852–2862, 2015. [5] A. Abdolghafourian, M. A. Iranmanesh, and A. C. Niemeyer. The divisibility graph of finite groups of Lie type. J. Pure Appl. Algebra, 221(10):2482–2493, 2017. [6] A. Abdollahi. Some Engel conditions on finite subsets of certain groups. Houston J. Math., 27(3):511–522, 2001. [7] A. Abdollahi. Engel graph associated with a group. J. Algebra, 318(2):680–691, 2007. [8] A. Abdollahi. Commuting graphs of full matrix rings over finite fields. Linear Algebra Appl., 428(11-12):2947–2954, 2008. [9] A. Abdollahi. Cohomologically trivial modules over finite groups of prime power order. J. Algebra, 342:154–160, 2011. [10] A. Abdollahi. Non-solvable groups generated by involutions in which every involution is left 2-Engel.
    [Show full text]