DOCSLIB.ORG

Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue∗

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue∗ SIAM J. DISCRETE MATH. c 2016 Society for Industrial and Applied Mathematics Vol. 30, No. 3, pp. 1509–1525 MAXIMIZING THE ORDER OF A REGULAR GRAPH OF GIVEN VALENCY AND SECOND EIGENVALUE∗ SEBASTIAN M. CIOABA˘ †,JACKH.KOOLEN‡, HIROSHI NOZAKI§, AND JASON R. VERMETTE¶ Abstract. From Alon√ and Boppana, and Serre, we know that for any given integer k ≥ 3 and real number λ<2 k − 1, there are only finitely many k-regular graphs whose second largest eigenvalue is at most λ. In this paper, we investigate the largest number of vertices of such graphs. Key words. second eigenvalue, regular graph, expander AMS subject classifications. 05C50, 05E99, 68R10, 90C05, 90C35 DOI. 10.1137/15M1030935 1. Introduction. For a k-regular graph G on n vertices, we denote by λ1(G)= k>λ2(G) ≥ ··· ≥ λn(G)=λmin(G) the eigenvalues of the adjacency matrix of G. For a general reference on the eigenvalues of graphs, see [8, 17]. The second eigenvalue of a regular graph is a parameter of interest in the study of graph connectivity and expanders (see [1, 8, 23], for example). In this paper, we investigate the maximum order v(k, λ) of a connected k-regular graph whose second largest eigenvalue is at most some given parameter λ. As a consequence of work of Alon and Boppana and of Serre√ [1, 11, 15, 23, 24, 27, 30, 34, 35, 40], we know that v(k, λ) is finite for λ<2 k − 1. The recent result of Marcus, Spielman, and Srivastava [28] showing the existence of infinite families of√ Ramanujan graphs of any degree at least 3 implies that v(k, λ) is infinite for λ ≥ 2 k − 1. For any λ<0, the parameter v(k, λ) can be determined using the fact that a graph with only one nonnegative eigenvalue is a complete graph. Indeed, if a graph has only one nonnegative eigenvalue, then it must be connected. If a connected graph G is not a complete graph, then G contains an induced subgraph isomorphic to K1,2,soCauchy eigenvalue interlacing (see [8, Proposition 3.2.1]) implies λ2(G) ≥ λ2(K1,2)=0,a contradiction. Thus v(k, λ)=k +1 foranyλ<0 and the unique graph meeting this bound is Kk+1. The parameter v(k, 0) can be determined using the fact that a graph with exactly one positive eigenvalue must be a complete multipartite graph (see [6, p. 89]). The largest k-regular complete multipartite graph is the complete bipartite graph Kk,k, since a k-regular t-partite graph has tk/(t − 1) vertices. Thus ∗Received by the editors July 15, 2015; accepted for publication May 16, 2016; published elec- tronically August 16, 2016. http://www.siam.org/journals/sidma/30-3/M103093.html †Department of Mathematical Sciences, University of Delaware, Newark, DE 19716-2553 (cioaba@ udel.edu). The research of this author was supported by the NSA grant H98230-13-1-0267 and NSF DMS-1600768. ‡School of Mathematical Sciences, University of Science and Technology of China, and Wen-Tsun Wu Key Laboratory of the Chinese Academy of Sciences, Hefei, Anhui, China ([email protected]). This author is partially supported by the National Natural Science Foundation of China (11471009). He also acknowledges the financial support of the Chinese Academy of Sciences under its “100 talent” program. §Department of Mathematics, Aichi University of Education, 1 Hirosawa, Igaya-cho, Kariya, Aichi 448-8542, Japan ([email protected]). This author is supported by JSPS KAKENHI grants 25800011, 26400003, and 16K17569. ¶Natural Sciences Division, Missouri Baptist University, Saint Louis, MO (Vermettej@mobap. edu). 1509 1510 CIOABA,ˇ KOOLEN, NOZAKI, AND VERMETTE v(k, 0) = 2k,andKk,k is the unique graph meeting this bound. The values of v(k, −1) and v(k, 0) also follow from Theorem 2.3 in section 2 below. Results from Bussemaker, Cvetkovi´c, and Seidel [9] and Cameron, Goethals, Sei- del, and Shult [10] give a characterization of the regular graphs with smallest eigen- value λmin ≥−2. Since the second eigenvalue of the complement of a regular graph is λ2 = −1 − λmin, the regular graphs with second eigenvalue λ2 ≤ 1 are also charac- terized. This characterization can be used to find v(k, 1) (see section√ 3). The values remaining to be investigated are v(k, λ)for1<λ<2 k − 1. The pa- rameter v(k, λ) has been studied by Teranishi and Yasuno [42] and Høholdt and Juste- sen [21] for the class of bipartite graphs in connection with problems in design theory, finite geometry, and coding theory. Some results involving v(k, λ) were obtained by Koledin and Stan´ıc [25, 26, 41] and Richey, Shutty, and Stover [45], who implemented Serre’s quantitative version of the Alon–Boppana theorem [40] to obtain upper bounds for v(k, λ) for several values of k and λ. For certain values of k and λ, Richey, Shutty, and Stover [45] made some conjectures about v(k, λ). We will prove some of their conjectures and disprove others in this paper. Reingold, Vadhan, and Wigderson [37] used regular graphs with small second eigenvalue as the starting point of their iter- ative construction of infinite families of expander using the zig-zag product. Guo, Mohar, and Tayfeh-Rezaie [18, 31, 32] studied a similar problem involving the median eigenvalue. Nozaki [36] investigated a related but different problem from the one stud- ied in our paper, namely, finding the regular graphs of given valency and order with smallest second eigenvalue. Amit, Hoory, and Linial [2] studied a related problem of minimizing max(|λ2|, |λn|) for regular graphs of given order n, valency k,andgirthg. In this paper, we determine v(k, λ) explicitly for several values of (k, λ), confirm- ing or disproving several conjectures in [45], and we find the graphs (in many cases unique) which meet our bounds. In many cases these graphs are distance-regular. For definitions and notation related to distance-regular graphs, we refer the reader to [8, Chapter 12]. Table 1 contains a summary of the values of v(k, λ) that we found for k ≤ 22. Table 2 contains six infinite families of graphs and seven sporadic graphs meeting the bound v(k, λ) for some values of k, λ due to Theorem 2.3. Table 3 illus- trates that the graphs in Table 2 that meet the bound v(k, λ) also meet the bound v(k, λ) for certain λ >λdue to Proposition 2.9. 2. Linear programming method. In this section, we give a bound for v(k, λ) (k) using the linear programming method developed by Nozaki [36]. Let Fi = Fi be orthogonal polynomials defined by the three-term recurrence relation: (k) (k) (k) 2 F0 (x)=1,F1 (x)=x, F2 (x)=x − k, and (k) (k) (k) Fi (x)=xFi−1(x) − (k − 1)Fi−2(x) for i ≥ 3. The following is called the linear programming bound for regular graphs. Theorem 2.1 (Nozaki [36]). Let G be a connected k-regular graph with v ver- tices. Let λ1 = k, λ2,...,λn be the distinct eigenvalues of G. Suppose there exists (k) a polynomial f(x)= i≥0 fiFi (x) such that f(k) > 0, f(λi) ≤ 0 for any i ≥ 2, f0 > 0,andfi ≥ 0 for any i ≥ 1. Then we have f(k) v ≤ . f0 LARGE GRAPHS OF GIVEN DEGREE AND SECOND EIGENVALUE 1511 Table 1 Summary of our results for k ≤ 22. (k, λ) v(k, λ) (k, λ) v(k, λ) (k, λ) v(k, λ) √ (2, −1) 3 (7, 1) 18 14, 13 366 √ (2, 0) 4 (7, 2) 50 14, 26 4760 √ √ , 1 − , − , 2 2 5 1 5 (8 1) 9 14 39 804468 , , , − (2√1) 6 (8 0) 16 (15 1) 16 2, 2 8 (8, 1) 21 (15, 0) 30 √ √ , 1 , , 2 2 5+1 10 8 7 114 (15 1) 32 √ √ 2, 3 12 8, 14 800 (16, −1) 17 √ (3, −1) 4 8, 21 39216 (16, 0) 32 (3, 0) 6 (9, −1) 10 (16, 1) 34 , , , (3√1) 10 (9 0) 18 (16 2) 77 3, 2 14 (9, 1) 24 (17, −1) 18 √ √ 3, 3 18 9, 2 2 146 (17, 0) 34 , , , (3√2) 30 (9 √4) 1170 (17 1) 36 3, 6 126 9, 2 6 74898 (18, −1) 19 (4, −1) 5 (10, −1) 11 (18, 0) 36 , , , (4 0) 8 (10 0) 20 (18√1) 38 (4, 1) 9 (10, 1) 27 18, 17 614 √ √ 4, 5 − 1 10 (10, 2) 56 18, 34 10440 √ √ 4, 3 26 (10, 3) 182 18, 51 3017196 √ (4, 2) 35 10, 3 2 1640 (19, −1) 20 √ √ 4, 6 80 10, 3 3 132860 (19, 0) 38 (4, 3) 728 (11, −1) 12 (19, 1) 40 (5, −1) 6 (11, 0) 22 (20, −1) 21 (5, 0) 10 (11, 1) 24 (20, 0) 40 , , − , (5 1) 16 (12 1) 13 (20√1) 42 (5, 2) 42 (12, 0) 24 20, 19 762 √ √ 5, 2 2 170 (12, 1) 26 20, 38 14480 √ √ √ 5, 2 3 2730 12, 11 266 20, 57 5227320 √ (6, −1) 7 12, 22 2928 (21, −1) 22 √ (6, 0) 12 12, 33 354312 (21, 0) 42 , , − , (6√1) 15 (13 1) 14 (21 1) 44 6, 5 62 (13, 0) 26 (22, −1) 23 √ 6, 10 312 (13, 1) 28 (22, 0) 44 √ 6, 15 7812 (14, −1) 15 (22, 1) 46 (7, −1) 8 (14, 0) 28 (22, 2) 100 (7, 0) 14 (14, 1) 30 Using Theorem 2.1, Nozaki [36] proved Theorem 2.2 below.
Load more

Recommended publications
  • Distance Regular Graphs Simply Explained
    Distance Regular Graphs Simply Explained Alexander Coulter Paauwe April 20, 2007 Copyright c 2007 Alexander Coulter Paauwe. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License”. Adjacency Algebra and Distance Regular Graphs: In this paper, we will discover some interesting properties of a particular kind of graph, called distance regular graphs, using algebraic graph theory. We will begin by developing some definitions that will allow us to explore the relationship between powers of the adjacency matrix of a graph and its eigenvalues, and ultimately give us particular insight into the eigenvalues of distance regular graphs. Basis for the Polynomial of an Adjacency Matrix We all know that for a given graph G, the powers of its adjacency matrix, A, have as their entries the number of n-walks between two vertices. More succinctly, we know that [An]i,j is the number of n-walks between the two vertices vi and vj. We also know that for a graph with diameter d, the first d powers of A are all linearly independent. Now, let us think of the set of all polynomials of the adjacency matrix, A, for a graph G. We can think of any member of the set as a linear combination of powers of A.
    [Show full text]
  • Investigations on Unit Distance Property of Clebsch Graph and Its Complement
    Proceedings of the World Congress on Engineering 2012 Vol I WCE 2012, July 4 - 6, 2012, London, U.K. Investigations on Unit Distance Property of Clebsch Graph and Its Complement Pratima Panigrahi and Uma kant Sahoo ∗yz Abstract|An n-dimensional unit distance graph is on parameters (16,5,0,2) and (16,10,6,6) respectively. a simple graph which can be drawn on n-dimensional These graphs are known to be unique in the respective n Euclidean space R so that its vertices are represented parameters [2]. In this paper we give unit distance n by distinct points in R and edges are represented by representation of Clebsch graph in the 3-dimensional Eu- closed line segments of unit length. In this paper we clidean space R3. Also we show that the complement of show that the Clebsch graph is 3-dimensional unit Clebsch graph is not a 3-dimensional unit distance graph. distance graph, but its complement is not. Keywords: unit distance graph, strongly regular The Petersen graph is the strongly regular graph on graphs, Clebsch graph, Petersen graph. parameters (10,3,0,1). This graph is also unique in its parameter set. It is known that Petersen graph is 2-dimensional unit distance graph (see [1],[3],[10]). It is In this article we consider only simple graphs, i.e. also known that Petersen graph is a subgraph of Clebsch undirected, loop free and with no multiple edges. The graph, see [[5], section 10.6]. study of dimension of graphs was initiated by Erdos et.al [3].
    [Show full text]
  • Constructing an Infinite Family of Cubic 1-Regular Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Europ. J. Combinatorics (2002) 23, 559–565 doi:10.1006/eujc.2002.0589 Available online at http://www.idealibrary.com on Constructing an Infinite Family of Cubic 1-Regular Graphs YQAN- UAN FENG† AND JIN HO KWAK A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163–182] constructed an infinite family of cubic 1-regular graphs of order 2p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marusiˇ cˇ and Xu [J. Graph Theory, 25 (1997), 133– 138] found a relation between cubic 1-regular graphs and tetravalent half-transitive graphs with girth 3 and Alspach et al.[J. Aust. Math. Soc. A, 56 (1994), 391–402] constructed infinitely many tetravalent half-transitive graphs with girth 3. Using these results, Miller’s construction can be generalized to an infinite family of cubic 1-regular graphs of order 2n, where n ≥ 13 is odd such that 3 divides ϕ(n), the Euler function of n. In this paper, we construct an infinite family of cubic 1-regular graphs with order 8(k2 + k + 1)(k ≥ 2) as cyclic-coverings of the three-dimensional Hypercube. c 2002 Elsevier Science Ltd. All rights reserved. 1. INTRODUCTION In this paper we consider an undirected finite connected graph without loops or multiple edges. For a graph G, we denote by V (G), E(G), A(G) and Aut(G) the vertex set, the edge set, the arc set and the automorphism group, respectively.
    [Show full text]
  • The Intriguing Human Preference for a Ternary Patterned Reality
    75 Kragujevac J. Sci. 27 (2005) 75-114. THE INTRIGUING HUMAN PREFERENCE FOR A TERNARY PATTERNED REALITY Lionello Pogliani,* Douglas J. Klein,‡ and Alexandru T. Balaban¥ *Dipartimento di Chimica Università della Calabria, 87030 Rende (CS), Italy; ‡Texas A&M University at Galveston, Galveston, Texas, 77553-1675, USA; ¥ Texas A&M University at Galveston, Galveston, Texas, 77551, USA E-mails: [email protected]; [email protected]; balabana @tamug.tamu.edu (Received February 10, 2005) Three paths through the high spring grass / One is the quicker / and I take it (Haikku by Yosa Buson, Spring wind on the river bank Kema) How did number theory degrade to numerology? How did numerology influence different aspects of human creation? How could some numbers assume such an extraordinary meaning? Why some numbers appear so often throughout the fabric of reality? Has reality really a preference for a ternary pattern? Present excursion through the ‘life’ and ‘deeds’ of this pattern and of its parent number in different fields of human culture try to offer an answer to some of these questions giving at the same time a glance of the strange preference of the human mind for a patterned reality based on number three, which, like the 'unary' and 'dualistic' patterned reality, but in a more emphatic way, ended up assuming an archetypical character in the intellectual sphere of humanity. Introduction Three is not only the sole number that is the sum of all the natural numbers less than itself, but it lies between arguably the two most important irrational and transcendental numbers of all mathematics, i.e., e < 3 < π.
    [Show full text]
  • Perfect Domination in Book Graph and Stacked Book Graph
    International Journal of Mathematics Trends and Technology (IJMTT) – Volume 56 Issue 7 – April 2018 Perfect Domination in Book Graph and Stacked Book Graph Kavitha B N#1, Indrani Pramod Kelkar#2, Rajanna K R#3 #1Assistant Professor, Department of Mathematics, Sri Venkateshwara College of Engineering, Bangalore, India *2 Professor, Department of Mathematics, Acharya Institute of Technology, Bangalore, India #3 Professor, Department of Mathematics, Acharya Institute of Technology, Bangalore, India Abstract: In this paper we prove that the perfect domination number of book graph and stacked book graph are same as the domination number as the dominating set satisfies the condition for perfect domination. Keywords: Domination, Cartesian product graph, Perfect Domination, Book Graph, Stacked Book Graph. I. INTRODUCTION By a graph G = (V, E) we mean a finite, undirected graph with neither loops nor multiple edges. The order and size of G are denoted by p and q respectively. For graph theoretic terminology we refer to Chartrand and Lesnaik[3]. Graphs have various special patterns like path, cycle, star, complete graph, bipartite graph, complete bipartite graph, regular graph, strongly regular graph etc. For the definitions of all such graphs we refer to Harry [7]. The study of Cross product of graph was initiated by Imrich [12]. For structure and recognition of Cross Product of graph we refer to Imrich [11]. In literature, the concept of domination in graphs was introduced by Claude Berge in 1958 and Oystein Ore in [1962] by [14]. For review of domination and its related parameters we refer to Acharya et.al. [1979] and Haynes et.al.
    [Show full text]
  • Strongly Regular Graphs
    Chapter 4 Strongly Regular Graphs 4.1 Parameters and Properties Recall that a (simple, undirected) graph is regular if all of its vertices have the same degree. This is a strong property for a graph to have, and it can be recognized easily from the adjacency matrix, since it means that all row sums are equal, and that1 is an eigenvector. If a graphG of ordern is regular of degreek, it means that kn must be even, since this is twice the number of edges inG. Ifk�n− 1 and kn is even, then there does exist a graph of ordern that is regular of degreek (showing that this is true is an exercise worth thinking about). Regularity is a strong property for a graph to have, and it implies a kind of symmetry, but there are examples of regular graphs that are not particularly “symmetric”, such as the disjoint union of two cycles of different lengths, or the connected example below. Various properties of graphs that are stronger than regularity can be considered, one of the most interesting of which is strong regularity. Definition 4.1.1. A graphG of ordern is called strongly regular with parameters(n,k,λ,µ) if every vertex ofG has degreek; • ifu andv are adjacent vertices ofG, then the number of common neighbours ofu andv isλ (every • edge belongs toλ triangles); ifu andv are non-adjacent vertices ofG, then the number of common neighbours ofu andv isµ; • 1 k<n−1 (so the complete graph and the null graph ofn vertices are not considered to be • � strongly regular).
    [Show full text]
  • Distances, Diameter, Girth, and Odd Girth in Generalized Johnson Graphs
    Distances, Diameter, Girth, and Odd Girth in Generalized Johnson Graphs Ari J. Herman Dept. of Mathematics & Statistics Portland State University, Portland, OR, USA Mathematical Literature and Problems project in partial fulfillment of requirements for the Masters of Science in Mathematics Under the direction of Dr. John Caughman with second reader Dr. Derek Garton Abstract Let v > k > i be non-negative integers. The generalized Johnson graph, J(v; k; i), is the graph whose vertices are the k-subsets of a v-set, where vertices A and B are adjacent whenever jA \ Bj = i. In this project, we present the results of the paper \On the girth and diameter of generalized Johnson graphs," by Agong, Amarra, Caughman, Herman, and Terada [1], along with a number of related additional results. In particular, we derive general formulas for the girth, diameter, and odd girth of J(v; k; i). Furthermore, we provide a formula for the distance between any two vertices A and B in terms of the cardinality of their intersection. We close with a number of possible future directions. 2 1. Introduction In this project, we present the results of the paper \On the girth and diameter of generalized Johnson graphs," by Agong, Amarra, Caughman, Herman, and Terada [1], along with a number of related additional results. Let v > k > i be non-negative integers. The generalized Johnson graph, X = J(v; k; i), is the graph whose vertices are the k-subsets of a v-set, with adjacency defined by A ∼ B , jA \ Bj = i: (1) Generalized Johnson graphs were introduced by Chen and Lih in [4].
    [Show full text]
  • ON SOME PROPERTIES of MIDDLE CUBE GRAPHS and THEIR SPECTRA Dr.S
    Science, Technology and Development ISSN : 0950-0707 ON SOME PROPERTIES OF MIDDLE CUBE GRAPHS AND THEIR SPECTRA Dr.S. Uma Maheswari, Lecturer in Mathematics, J.M.J. College for Women (Autonomous) Tenali, Andhra Pradesh, India Abstract: In this research paper we begin with study of family of n For example, the boundary of a 4-cube contains 8 cubes, dimensional hyper cube graphs and establish some properties related to 24 squares, 32 lines and 16 vertices. their distance, spectra, and multiplicities and associated eigen vectors and extend to bipartite double graphs[11]. In a more involved way since no complete characterization was available with experiential results in several inter connection networks on this spectra our work will add an element to existing theory. Keywords: Middle cube graphs, distance-regular graph, antipodalgraph, bipartite double graph, extended bipartite double graph, Eigen values, Spectrum, Adjacency Matrix.3 1) Introduction: An n dimensional hyper cube Qn [24] also called n-cube is an n dimensional analogue of Square and a Cube. It is closed compact convex figure whose 1-skelton consists of groups of opposite parallel line segments aligned in each of spaces dimensions, perpendicular to each other and of same length. 1.1) A point is a hypercube of dimension zero. If one moves this point one unit length, it will sweep out a line segment, which is the measure polytope of dimension one. A projection of hypercube into two- dimensional image If one moves this line segment its length in a perpendicular direction from itself; it sweeps out a two-dimensional square.
    [Show full text]
  • Self-Dual Configurations and Regular Graphs
    SELF-DUAL CONFIGURATIONS AND REGULAR GRAPHS H. S. M. COXETER 1. Introduction. A configuration (mci ni) is a set of m points and n lines in a plane, with d of the points on each line and c of the lines through each point; thus cm = dn. Those permutations which pre­ serve incidences form a group, "the group of the configuration." If m — n, and consequently c = d, the group may include not only sym­ metries which permute the points among themselves but also reci­ procities which interchange points and lines in accordance with the principle of duality. The configuration is then "self-dual," and its symbol («<*, n<j) is conveniently abbreviated to na. We shall use the same symbol for the analogous concept of a configuration in three dimensions, consisting of n points lying by d's in n planes, d through each point. With any configuration we can associate a diagram called the Menger graph [13, p. 28],x in which the points are represented by dots or "nodes," two of which are joined by an arc or "branch" when­ ever the corresponding two points are on a line of the configuration. Unfortunately, however, it often happens that two different con­ figurations have the same Menger graph. The present address is concerned with another kind of diagram, which represents the con­ figuration uniquely. In this Levi graph [32, p. 5], we represent the points and lines (or planes) of the configuration by dots of two colors, say "red nodes" and "blue nodes," with the rule that two nodes differently colored are joined whenever the corresponding elements of the configuration are incident.
    [Show full text]
  • Some Results on 2-Odd Labeling of Graphs
    International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8 Issue-5, January 2020 Some Results on 2-odd Labeling of Graphs P. Abirami, A. Parthiban, N. Srinivasan Abstract: A graph is said to be a 2-odd graph if the vertices of II. MAIN RESULTS can be labelled with integers (necessarily distinct) such that for In this section, we establish 2-odd labeling of some graphs any two vertices which are adjacent, then the modulus difference of their labels is either an odd integer or exactly 2. In this paper, such as wheel graph, fan graph, generalized butterfly graph, we investigate 2-odd labeling of some classes of graphs. the line graph of sunlet graph, and shell graph. Lemma 1. Keywords: Distance Graphs, 2-odd Graphs. If a graph has a subgraph that does not admit a 2-odd I. INTRODUCTION labeling then G cannot have a 2-odd labeling. One can note that the Lemma 1 clearly holds since if has All graphs discussed in this article are connected, simple, a 2-odd labeling then this will yield a 2-odd labeling for any subgraph of . non-trivial, finite, and undirected. By , or simply , Definition 1: [5] we mean a graph whose vertex set is and edge set is . The wheel graph is a graph with vertices According to J. D. Laison et al. [2] a graph is 2-odd if there , formed by joining the central vertex to all the exists a one-to-one labeling (“the set of all vertices of . integers”) such that for any two vertices and which are Theorem 1: adjacent, the integer is either exactly 2 or an The wheel graph admits a 2-odd labeling for all .
    [Show full text]
  • The Distance-Regular Antipodal Covers of Classical Distance-Regular Graphs
    COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 52. COMBINATORICS, EGER (HUNGARY), 198'7 The Distance-regular Antipodal Covers of Classical Distance-regular Graphs J. T. M. VAN BON and A. E. BROUWER 1. Introduction. If r is a graph and "Y is a vertex of r, then let us write r,("Y) for the set of all vertices of r at distance i from"/, and r('Y) = r 1 ('Y)for the set of all neighbours of 'Y in r. We shall also write ry ...., S to denote that -y and S are adjacent, and 'YJ. for the set h} u r b) of "/ and its all neighbours. r i will denote the graph with the same vertices as r, where two vertices are adjacent when they have distance i in r. The graph r is called distance-regular with diameter d and intersection array {bo, ... , bd-li c1, ... , cd} if for any two vertices ry, oat distance i we have lfH1(1')n nr(o)j = b, and jri-ib) n r(o)j = c,(o ::; i ::; d). Clearly bd =co = 0 (and C1 = 1). Also, a distance-regular graph r is regular of degree k = bo, and if we put ai = k- bi - c; then jf;(i) n r(o)I = a, whenever d("f, S) =i. We shall also use the notations k, = lf1b)I (this is independent of the vertex ry),). = a1,µ = c2 . For basic properties of distance-regular graphs, see Biggs [4]. The graph r is called imprimitive when for some I~ {O, 1, ... , d}, I-:/= {O}, If -:/= {O, 1, ..
    [Show full text]
  • Graph Diameter, Eigenvalues, and Minimum-Time Consensus∗
    Graph diameter, eigenvalues, and minimum-time consensus∗ J. M. Hendrickxy, R. M. Jungersy, A. Olshevskyz, G. Vankeerbergheny July 24, 2018 Abstract We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called “definitive consensus conjecture" which states that for an undirected connected graph G with diameter D there exist D matrices whose nonzero-pattern complies with the edges in G and whose product equals the all-ones matrix. Our first result is a counterexample to the definitive consensus conjecture, which is the first improvement of the diameter lower bound for linear consensus protocols. We then provide some algebraic conditions under which this conjecture holds, which we use to establish that all distance-regular graphs satisfy the definitive consensus conjecture. 1 Introduction Consensus algorithms are a class of iterative update schemes commonly used as building blocks for distributed estimation and control protocols. The progresses made within recent years in analyzing and designing consensus algorithms have led to advances in a number of fields, for example, distributed estimation and inference in sensor networks [6, 20, 21], distributed optimization [15], and distributed machine learning [1]. These are among the many subjects that have benefitted from the use of consensus algorithms. One of the available methods to design an average consensus algorithm is to use constant update weights satisfying some conditions for convergence (as can be found in [3] for instance). However, the associated rate of convergence might be a limiting factor, and this has spanned a literature dedicated to optimizing the speed of consensus algorithms.
    [Show full text]