DOCSLIB.ORG

Discrete Applied Mathematics on B-Colorings in Regular Graphs$

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Discrete Applied Mathematics on B-Colorings in Regular Graphs$ View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 157 (2009) 1787–1793 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On b-colorings in regular graphsI Mostafa Blidia a, Frédéric Maffray b,∗, Zoham Zemir a a Département de Mathématiques, Université de Blida, B.P. 270, Blida, Algeria b C.N.R.S, Laboratoire G-SCOP, 46 Avenue Félix Viallet, 38031 Grenoble Cedex, France article info a b s t r a c t Article history: A b-coloring is a coloring of the vertices of a graph such that each color class contains a Received 30 July 2008 vertex that has a neighbor in all other color classes. El-Sahili and Kouider have conjectured Received in revised form 6 January 2009 that every d-regular graph with girth at least 5 has a b-coloring with d C 1 colors. We show Accepted 9 January 2009 that the Petersen graph infirms this conjecture, and we propose a new formulation of this Available online 10 February 2009 question and give a positive answer for small degree. ' 2009 Elsevier B.V. All rights reserved. Keywords: Coloration b-coloring a-chromatic number b-chromatic number 1. Introduction A proper coloring of a graph G D .V ; E/ is a mapping c from V to the set of positive integers (colors) such that any two adjacent vertices are mapped to different colors. Each set of vertices colored with one color is a stable set of vertices of G, so a coloring is a partition of V into stable sets. The smallest number k for which G admits a coloring with k colors is the chromatic number χ.G/ of G. Many graph invariants related to colorings have been defined. Most of them try to minimize the number of colors used to color the vertices under some constraints. For some other invariants, it is meaningful to try to maximize this number. The b-chromatic number is such an example. When we try to color the vertices of a graph, a simple trick consists in starting from a coloring and trying to decrease the number of colors by reducing them in some way, for example by merging two color classes. This motivated the introduction of the achromatic number by Harary and Hedetniemi [6]: the achromatic number of a graph G is the largest integer k such that G admits a coloring with k colors for which there is an edge between any two color classes. Clearly, the process of merging suggested above is impossible if we have such a coloring. So the achromatic number is a measure of how hard it is to obtain a coloring with few colors. This inspired Irving and Manlove [8,13] to consider another procedure, which consists in trying to reduce the number of colors by transferring all vertices from one color class to other classes. A b-coloring is a proper coloring such that every color class i contains at least one vertex that has a neighbor in all the other classes. Any such vertex will be called a b-dominating vertex of color i. The b-chromatic number b.G/ is the largest integer k such that G admits a b-coloring with k colors. For a graph G, and for any vertex v of G, the neighborhood of v is the set N.v/ D fu 2 V .G/ j uv 2 E.G/g and the degree of v is deg.v/ D jN.v/j. Let ∆.G/ be the maximum degree in G, and let m.G/ be the largest integer k such that G has k vertices of degree at least k − 1. It is easy to see that every graph G satisfies b.G/ ≤ m.G/ ≤ ∆.G/ C 1 I This research was supported by the Algerian/French program CMEP/Tassili 05 MDU 639. ∗ Corresponding author. 0166-218X/$ – see front matter ' 2009 Elsevier B.V. All rights reserved. doi:10.1016/j.dam.2009.01.007 1788 M. Blidia et al. / Discrete Applied Mathematics 157 (2009) 1787–1793 (the first inequality follows from the fact that if G has any b-coloring with k colors then it has k vertices of degree at least k − 1; the second inequality follows from the definition of m.G/). Irving and Manlove [8,13] proved that every tree T has b-chromatic number b.T / equal to either m.T / or m.T / − 1, and their proof is a polynomial-time algorithm that computes the value of b.T /. On the other hand, Kratochvíl, Tuza and Voigt [12] proved that it is NP-complete to decide if b.G/ D m.G/, even when restricted to the class of connected bipartite graphs such that m.G/ D ∆.G/ C 1. These NP-completeness results have incited researchers to establish bounds on the b-chromatic number in general or to find exact or approximate values for subclasses of graphs [1–4,7,9–11]. Here we focus on a recent problem concerning regular graphs. A graph G is d-regular if every vertex of G has degree equal to d. Note that every d-regular graph G satisfies m.G/ D d C 1. The girth of G is the length of a shortest cycle in G. In [3], El-Sahili and Kouider pose the following question: Question ([3]). Is it true that every d-regular graph G with girth g.G/ ≥ 5 satisfies b.G/ D d C 1? We observe that the Petersen graph offers a negative answer to this question. However, we also propose some positive results in the case where d ≤ 6 which suggest that the Petersen graph might be the only counterexample to the question. 2. Preliminary results For integer k ≥ 3, we let Ck denote the cycle with k vertices. Theorem 1. The Petersen graph has b-chromatic number 3. Proof. Let G be the Petersen graph, with vertices v1; : : : ; v5; w1; : : : ; w5 such that v1; v2; v3; v4; v5 induce a 5-cycle in this order, w1; w3; w5; w2; w4 induce a 5-cycle in this order, and viwi is an edge for each i D 1;:::; 5. Since χ.G/ D 3, we have b.G/ ≥ 3. Suppose that G admits a b-coloring with 4 colors. For j D 1;:::; 4, let dj be a b-dominating vertex of color j, and let D D fd1;:::; d4g. Note that each vertex dj must have exactly one neighbor of each of the three colors different from j. Suppose that D induces a stable set. So, up to symmetry, we can assume that D D fv1; v3; w4; w5g, with d1 D v1, d3 D v3, d2 D w4, d4 D w5. Without loss of generality, v2 has color 2, and so w2 does not have color 2. Since v1 is b-dominating, it must have a neighbor of color 4, which can only be w1, and a neighbor of color 3, which can only be v5. Since v3 is b- dominating, it must have a neighbor of color 4, which can only be v4, and a neighbor of color 1, which can only be w3. But then w5 cannot have a neighbor of color 2, a contradiction. So D does not induce a stable set. We may assume that d1; d2 are adjacent, and so, up to symmetry, that d1 D v1 and d2 D v2 (since all edges of the Petersen graph play the same role). Now, it is easy to see that, wherever d3 may be, there is a C5 of G that contains d1; d2; d3. So (since all C5's of the Petersen graph play the same role), we can assume that d3 is one of v3; v4; v5. Up to symmetry, this leads to two cases. Case 1: d3 D v3. Since v2 is b-dominating, it has a neighbor of color 4, which can only be w2. One of v4; v5, say v5, does not have color 4. Since v1 is b-dominating, it has a neighbor of color 4, which can only be w1, and a neighbor of color 3, which can only be v5. Since v3 is b-dominating, it has a neighbor of color 4, which can only be v4, and a neighbor of color 1, which can only be w3. Note that w5 can only have color 2. But now, the vertices of color 4 are w1; w2; v4 and no other vertex, and each of these three vertices has two neighbors of the same color, so none of them can be b-dominating, a contradiction. Case 2: d3 D v4. Since v1 is b-dominating, it has a neighbor of color 3, which can only be w1, and a neighbor of color 4, which can only be v5. Likewise v2 has a neighbor of color 3, which can only be w2, and a neighbor of color 4, which can only be v3. But then v4 has two neighbors of color 4, so it cannot be b-dominating, a contradiction. We will need the following result, for which we give a new proof. Our proof is rather similar to the proof of Proposition 2 in [3]; we include it here for the sake of completeness and because it prepares the more complicated proof of Theorem 5. Theorem 2 ([9]). Every d-regular graph G with girth g.G/ ≥ 6 has a b-coloring with d C 1 colors.
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]
  • 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]
  • 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.
    [Show full text]
  • On the Cycle Double Cover Problem
    On The Cycle Double Cover Problem Ali Ghassâb1 Dedicated to Prof. E.S. Mahmoodian Abstract In this paper, for each graph , a free edge set is defined. To study the existence of cycle double cover, the naïve cycle double cover of have been defined and studied. In the main theorem, the paper, based on the Kuratowski minor properties, presents a condition to guarantee the existence of a naïve cycle double cover for couple . As a result, the cycle double cover conjecture has been concluded. Moreover, Goddyn’s conjecture - asserting if is a cycle in bridgeless graph , there is a cycle double cover of containing - will have been proved. 1 Ph.D. student at Sharif University of Technology e-mail: [email protected] Faculty of Math, Sharif University of Technology, Tehran, Iran 1 Cycle Double Cover: History, Trends, Advantages A cycle double cover of a graph is a collection of its cycles covering each edge of the graph exactly twice. G. Szekeres in 1973 and, independently, P. Seymour in 1979 conjectured: Conjecture (cycle double cover). Every bridgeless graph has a cycle double cover. Yielded next data are just a glimpse review of the history, trend, and advantages of the research. There are three extremely helpful references: F. Jaeger’s survey article as the oldest one, and M. Chan’s survey article as the newest one. Moreover, C.Q. Zhang’s book as a complete reference illustrating the relative problems and rather new researches on the conjecture. A number of attacks, to prove the conjecture, have been happened. Some of them have built new approaches and trends to study.
    [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]
  • On Cayley Graphs of Algebraic Structures
    On Cayley graphs of algebraic structures Didier Caucal1 1 CNRS, LIGM, University Paris-East, France [email protected] Abstract We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree. 1 Introduction To describe the structure of a group, Cayley introduced in 1878 [7] the concept of graph for any group (G, ·) according to any generating subset S. This is simply the set of labeled s oriented edges g −→ g·s for every g of G and s of S. Such a graph, called Cayley graph, is directed and labeled in S (or an encoding of S by symbols called letters or colors). The study of groups by their Cayley graphs is a main topic of algebraic graph theory [3, 8, 2]. A characterization of unlabeled and undirected Cayley graphs was given by Sabidussi in 1958 [15] : an unlabeled and undirected graph is a Cayley graph if and only if we can find a group with a free and transitive action on the graph. However, this algebraic characterization is not well suited for deciding whether a possibly infinite graph is a Cayley graph. It is pertinent to look for characterizations by graph-theoretic conditions. This approach was clearly stated by Hamkins in 2010: Which graphs are Cayley graphs? [10]. In this paper, we present simple graph-theoretic characterizations of Cayley graphs for firstly left-cancellative and cancellative monoids, and then for groups. These characterizations are then extended to any subset S of left-cancellative magmas, left-quasigroups, quasigroups, and groups.
    [Show full text]
  • Towards a Classification of Distance-Transitive Graphs
    数理解析研究所講究録 1063 巻 1998 年 72-83 72 Towards a classification of distance-transitive graphs John van Bon Abstract We outline the programme of classifying all finite distance-transitive graphs. We men- tion the most important classification results obtained so far and give special attention to the so called affine graphs. 1. Introduction The graphs in this paper will be always assumed to be finite, connected, undirected and without loops or multiple edges. The edge set of a graph can thus be identified with a subset of the set of unoidered pairs of vertices. Let $\Gamma=(V\Gamma, E\Gamma)$ be a graph and $x,$ $y\in V\Gamma$ . With $d(x, y)$ we will denote the usual distance $\Gamma$ in between the vertices $x$ and $y$ (i.e., the length of the shortest path connecting $x$ and $y$ ) and with $d$ we will denote the diameter of $\Gamma$ , the maximum of all possible values of $d(x, y)$ . Let $\Gamma_{i}(x)=\{y|y\in V\Gamma, d(x, y)=i\}$ be the set of all vertices at distance $i$ of $x$ . An $aut_{omo}rph7,sm$ of a graph is a permutation of the vertex set that maps edges to edges. Let $G$ be a group acting on a graph $\Gamma$ (i.e. we are given a morphism $Garrow Aut(\Gamma)$ ). For a $x\in V\Gamma$ $x^{g}$ vertex and $g\in G$ the image of $x$ under $g$ will be denoted by . The set $\{g\in G|x^{g}=x\}$ is a subgroup of $G$ , called that stabilizer in $G$ of $x$ and will be denoted by $G_{x}$ .
    [Show full text]
  • Large Girth Graphs with Bounded Diameter-By-Girth Ratio 3
    LARGE GIRTH GRAPHS WITH BOUNDED DIAMETER-BY-GIRTH RATIO GOULNARA ARZHANTSEVA AND ARINDAM BISWAS Abstract. We provide an explicit construction of finite 4-regular graphs (Γk)k∈N with girth Γk k → ∞ as k and diam Γ 6 D for some D > 0 and all k N. For each dimension n > 2, we find a → ∞ girth Γk ∈ pair of matrices in SLn(Z) such that (i) they generate a free subgroup, (ii) their reductions mod p generate SLn(Fp) for all sufficiently large primes p, (iii) the corresponding Cayley graphs of SLn(Fp) have girth at least cn log p for some cn > 0. Relying on growth results (with no use of expansion properties of the involved graphs), we observe that the diameter of those Cayley graphs is at most O(log p). This gives infinite sequences of finite 4-regular Cayley graphs as in the title. These are the first explicit examples in all dimensions n > 2 (all prior examples were in n = 2). Moreover, they happen to be expanders. Together with Margulis’ and Lubotzky-Phillips-Sarnak’s classical con- structions, these new graphs are the only known explicit large girth Cayley graph expanders with bounded diameter-by-girth ratio. 1. Introduction The girth of a graph is the edge-length of its shortest non-trivial cycle (it is assigned to be infinity for an acyclic graph). The diameter of a graph is the greatest edge-length distance between any pair of its vertices. We regard a graph Γ as a sequence of its connected components Γ = (Γk)k∈N each of which is endowed with the edge-length distance.
    [Show full text]
  • Girth in Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMBINATORIAL THEORY. Series B 35, 129-141 (1983) Girth in Graphs CARSTEN THOMASSEN Mathematical institute, The Technicai University oJ Denmark, Building 303, Lyngby DK-2800, Denmark Communicated by the Editors Received March 31, 1983 It is shown that a graph of large girth and minimum degree at least 3 share many properties with a graph of large minimum degree. For example, it has a contraction containing a large complete graph, it contains a subgraph of large cyclic vertex- connectivity (a property which guarantees, e.g., that many prescribed independent edges are in a common cycle), it contains cycles of all even lengths module a prescribed natural number, and it contains many disjoint cycles of the same length. The analogous results for graphs of large minimum degree are due to Mader (Math. Ann. 194 (1971), 295-312; Abh. Math. Sem. Univ. Hamburg 31 (1972), 86-97), Woodall (J. Combin. Theory Ser. B 22 (1977), 274-278), Bollobis (Bull. London Math. Sot. 9 (1977), 97-98) and Hlggkvist (Equicardinal disjoint cycles in sparse graphs, to appear). Also, a graph of large girth and minimum degree at least 3 has a cycle with many chords. An analogous result for graphs of chromatic number at least 4 has been announced by Voss (J. Combin. Theory Ser. B 32 (1982), 264-285). 1, INTRODUCTION Several authors have establishedthe existence of various configurations in graphs of sufficiently large connectivity (independent of the order of the graph) or, more generally, large minimum degree (see, e.g., [2, 91).
    [Show full text]
  • Computing the Girth of a Planar Graph in Linear Time∗
    Computing the Girth of a Planar Graph in Linear Time∗ Hsien-Chih Chang† Hsueh-I Lu‡ April 22, 2013 Abstract The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first non-trivial algorithm for the problem, given by Djidjev, runs in O(n5/4 log n) time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to O(n log2 n). Weimann and Yuster further reduced the running time to O(n log n). In this paper, we solve the problem in O(n) time. 1 Introduction Let G be an edge-weighted simple graph, i.e., G does not contain multiple edges and self- loops. We say that G is unweighted if the weight of each edge of G is one. A cycle of G is simple if each node and each edge of G is traversed at most once in the cycle. The girth of G, denoted girth(G), is the minimum weight of all simple cycles of G. For instance, the girth of each graph in Figure 1 is four. As shown by, e.g., Bollobas´ [4], Cook [12], Chandran and Subramanian [10], Diestel [14], Erdos˝ [21], and Lovasz´ [39], girth is a fundamental combinatorial characteristic of graphs related to many other graph properties, including degree, diameter, connectivity, treewidth, and maximum genus. We address the problem of computing the girth of an n-node graph. Itai and Rodeh [28] gave the best known algorithm for the problem, running in time O(M(n) log n), where M(n) is the time for multiplying two n × n matrices [13].
    [Show full text]
  • Strongly Regular Graphs, Part 1 23.1 Introduction 23.2 Definitions
    Spectral Graph Theory Lecture 23 Strongly Regular Graphs, part 1 Daniel A. Spielman November 18, 2009 23.1 Introduction In this and the next lecture, I will discuss strongly regular graphs. Strongly regular graphs are extremal in many ways. For example, their adjacency matrices have only three distinct eigenvalues. If you are going to understand spectral graph theory, you must have these in mind. In many ways, strongly-regular graphs can be thought of as the high-degree analogs of expander graphs. However, they are much easier to construct. Many times someone has asked me for a matrix of 0s and 1s that \looked random", and strongly regular graphs provided a resonable answer. Warning: I will use the letters that are standard when discussing strongly regular graphs. So λ and µ will not be eigenvalues in this lecture. 23.2 Definitions Formally, a graph G is strongly regular if 1. it is k-regular, for some integer k; 2. there exists an integer λ such that for every pair of vertices x and y that are neighbors in G, there are λ vertices z that are neighbors of both x and y; 3. there exists an integer µ such that for every pair of vertices x and y that are not neighbors in G, there are µ vertices z that are neighbors of both x and y. These conditions are very strong, and it might not be obvious that there are any non-trivial graphs that satisfy these conditions. Of course, the complete graph and disjoint unions of complete graphs satisfy these conditions.
    [Show full text]