DOCSLIB.ORG

Mixed Moore Graphs. GT2015, Nyborg

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mixed Moore Graphs. GT2015, Nyborg Mixed Moore Graphs. GT2015, Nyborg Leif K. Jørgensen Aalborg University Denmark Moore Graphs A Moore graph of diameter D is a (regular) graph (undirected/directed/mixed) with the property that for any two vertices x; y, there is a unique path of length at most D from x to y. In this talk the degree of a Moore graph is denoted by k. An undirected Moore graph with degree k and diameter D has order M(k; D) := 1 + k + k(k − 1) + k(k − 1)2 + ::: + k(k − 1)D−1: The Moore bound M(k; D) is • an upper bound on the order of a undirected graph with max. degree k and diameter D. • an lower bound on the order of an undirected graph with min. degree k and girth 2D + 1. Theorem Hoffman + Singleton 1960 If a Moore graph with diameter D = 2 then the degree is either • k = 2, unique Moore graph: the cycle of length 5, • k = 3, unique Moore graph: the Petersen graph, • k = 7, unique Moore graph: the Hoffman-Singleton graph, or • k = 57, existence of Moore is unknown. Theorem Damerell 1973, Bannai + Ito 1973 A Moore graph with k ≥ 3 and D ≥ 3 does not exist. Petersen graph G = (V; E) : graph An automorphism of G is a is a bijection φ : V ! V such that xy 2 E () φ(x)φ(y) 2 E: Aut(G) denotes the group of all automorphisms of G. Does there exist a Moore graph with D = 2 and k = 57. Number of vertices is 3250. Theorem Macajˇ + Sirˇ a´nˇ 2010 A Moore graph of degree 57 has at most 375 automorphisms. G = (V; E) : graph An automorphism of G is a is a bijection φ : V ! V such that xy 2 E () φ(x)φ(y) 2 E: Aut(G) denotes the group of all automorphisms of G. Does there exist a Moore graph with D = 2 and k = 57. Number of vertices is 3250. Theorem Macajˇ + Sirˇ a´nˇ 2010 A Moore graph of degree 57 has at most 375 automorphisms. A Cayley graph Cay(X; S) of a group X with connection set S ⊂ X is the graph with vertex set X and edges xy where yx−1 2 S; i.e., there is an edge from x to sx, where s 2 S. Example: C5 = Cay(Z5; f1; −1g) 0 ZZ w Z Z Z Z Z Z Z Z Z 4 A ¡ 1 A ¡ ww A ¡ A ¡ A ¡ A ¡ A ¡ A ¡ A ¡ AA ¡¡ 23 ww Theorem (Sabidussi) A graph G is a Cayley graph of a group X if and only if X is a sharply transitive (regular) subgroup of Aut(G). Sharply transitive means that for every u; v 2 V (G) there is a unique φ 2 X such that φ(u) = v. Theorem An undirected Moore other than C5 is not a Cayley graph. Proof: An automorphism φ with φ ◦ φ = Id and φ(v) 6= v for all vertices v. Theorem (Sabidussi) A graph G is a Cayley graph of a group X if and only if X is a sharply transitive (regular) subgroup of Aut(G). Sharply transitive means that for every u; v 2 V (G) there is a unique φ 2 X such that φ(u) = v. Theorem An undirected Moore other than C5 is not a Cayley graph. Proof: An automorphism φ with φ ◦ φ = Id and φ(v) 6= v for all vertices v. Directed Moore Graphs The number of vertices in a directed Moore graph with degree k and diam- eter D is −! M(k; D) = 1 + k + k2 + ::: + kD: Theorem Plesn´ık and Znam´ 1974, Bridges and Toueg 1980. Directed Moore graphs do not exist except in the trivial cases: • D = 1, complete directed graphs Kk+1, and • k = 1, directed cycles CD+1. −! M(k; D) is an upper bound on the order of a directed graph with max. out-degree k and diameter D. Lower bound (k ≥ 3): kD−1 + kD from Kautz digraphs. If G is directed k-regular graph with diameter D then the line-digraph L(G) is k-regular and has diameter (at most) D + 1. D−1 The Kautz digraph L (Kk+1) is a k-regular digraph with diameter D. Mixed Moore Graphs Mixed graph: directed and undirected edges. Theorem (Bosak,´ 1979) A mixed graph with diameter D with the property that for every pair (x; y) of vertices there is a unique path of length at most D from x to y is either an undirected tree or else there exist numbers t and z such • every vertex has undirected degree t • every vertex has directed out-degree z and directed in-degree z. In the regular case the graph is called a mixed Moore graph. Theorem (Nguyen, Miller, Gimbert 2007) Mixed Moore graphs of diameter at least 3 do not exist. Consider mixed Moore graph of diameter 2. Theorem (Bosak,´ 1979) If a mixed Moore graph is not a directed triangle or a 5-cycle then the eigenvalues are k = t + z with multiplicity 1 and (integers) −1±c where p 2 c = 4t − 3. c2+3 c is an odd positive integer t = 4 and c j (4z − 3)(4z + 5). Possible values of t: 1; 3; 7; 13; 21;:::. For each value of t: infinitely many values of z. n = (t + z)2 + z + 1 t = 1 z = 1; 2; 3; 4;::: The Kautz digraph on (z + 2)(z + 1) vertices is the line-digraph of a the complete directed graph on z + 2 vertices, L(Kz+2). This is a mixed Moore graph for every z. Gimbert 2001: Kautz digraphs are unique mixed Moore graph with t = 1. Every permutation of the vertices of the Kz+2 induces an automorphism of L(Kz+2). Theorem L(Kz+2) is a Cayley graph if and only if z + 2 is a prime-power. Proof: Suppose that L(Kz+2) is a Cayley graph of a group X. Then (Sabidussi) X has a sharply transitive action on vertices of L(Kz+2). X has sharply transitive action on edges (ordered pairs of distinct vertices) of Kz+2. X has sharply 2-transitive action on vertices of L(Kz+2). Zassenhaus (1935): z + 2 is a prime-power and X is an affine group AGL(1; z + 2) (or one of a few exceptional groups). Cay(X; S) is a mixed Moore graph if and only if • for g 2 S there is no pair (s1; s2) 2 S × S such that g = s1s2 • for g2 = S there is a unique pair (s1; s2) 2 S × S such that g = s1s2 And then k = t + z = jSj and t = jS \ S(−1)j, where S(−1) = fs−1 j s 2 Sg. " # α a X = f j α, a 2 GF [z + 2]; α 6= 0g. 0 1 One possible choice for the connection set " # α 1 S = f j α 2 GF [z + 2]; α 6= 0g. 0 1 " #" # " # α 1 β 1 αβ α + 1 = 0 1 0 1 0 1 Feasible cases with t > 1 and n ≤ 200: n t z 18 3 1 40 3 3 54 3 4 84 7 2 88 3 6 108 3 7 150 7 5 154 3 9 180 3 10 For t = 3; z = 1, Bosak´ constructed a graph. It has 18 vertices. Bosak´ graph = Pappus graph + six directed triangles is mixed Moore graph. Nguyen, Miller, Gimbert 2007: Bosak´ graph is unique. The Bosak´ graph is a Cayley graph Cay(X; S), where 2α 0 a3 6 7 X = f40 α b5 j α, a; b 2 GF [3]; α 6= 0g 0 0 1 22 0 03 22 0 03 22 0 13 21 0 13 6 7 6 7 6 7 6 7 S = f40 2 05 ; 40 2 15 ; 40 2 05 ; 40 1 15g 0 0 1 0 0 1 0 0 1 0 0 1 Pappus graph and Bosa´k graph Theorem J. 2015 There exist at least two mixed Moore graphs with n = 108; t = 3; z = 7. T We denote these graph by G108 and G108. One is transposed of the other. They are both Cayley graphs of groups number 15 and 17 is the GAP catalogue of groups of order 108. Group number 17 is isomorphic to automorphism group of the Bosak´ graph, and it is also isomorphic to 2α a b3 6 7 X = f40 β c5 j α, β; a; b; c 2 GF [3]; α, β 6= 0g 0 0 1 Theorem J. 2015 Suppose that G is mixed Moore graph with n = 40; t = z = 3. Then G does not contain an undirected 5-cycle. Theorem J. A mixed Moore with t = 7; z = 2; n = 84 does not exist. Proof: Computer search. Feasible cases with t > 1 and n ≤ 200: n t z Exist ? 18 3 1 Bosak´ 40 3 3 54 3 4 84 7 2 NO 88 3 6 108 3 7 Cayley graph 150 7 5 154 3 9 180 3 10 Theorem J. A mixed Moore with t = 7; z = 2; n = 84 does not exist. Proof: Computer search. Feasible cases with t > 1 and n ≤ 200: n t z Exist ? 18 3 1 Bosak´ 40 3 3 54 3 4 84 7 2 NO 88 3 6 108 3 7 Cayley graph 150 7 5 154 3 9 180 3 10.
Load more

Recommended publications
  • Avoiding Rainbow Induced Subgraphs in Vertex-Colorings
    Avoiding rainbow induced subgraphs in vertex-colorings Maria Axenovich and Ryan Martin∗ Department of Mathematics, Iowa State University, Ames, IA 50011 [email protected], [email protected] Submitted: Feb 10, 2007; Accepted: Jan 4, 2008 Mathematics Subject Classification: 05C15, 05C55 Abstract For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of G with k colors, there is an induced subgraph isomorphic to H whose vertices have distinct colors. In other words, if G −→ H then a totally multicolored induced copy of H is unavoidable in any vertex-coloring of G with k colors. In this paper, we show that, with a few notable exceptions, for any graph H on k vertices and for any graph G which is not isomorphic to H, G 6−→ H. We explicitly describe all exceptional cases. This determines the induced vertex- anti-Ramsey number for all graphs and shows that totally multicolored induced subgraphs are, in most cases, easily avoidable. 1 Introduction Let G =(V, E) be a graph. Let c : V (G) → [k] be a vertex-coloring of G. We say that G is monochromatic under c if all vertices have the same color and we say that G is rainbow or totally multicolored under c if all vertices of G have distinct colors. The existence of a arXiv:1605.06172v1 [math.CO] 19 May 2016 graph forcing an induced monochromatic subgraph isomorphic to H is well known. The following bounds are due to Brown and R¨odl: Theorem 1 (Vertex-Induced Graph Ramsey Theorem [6]) For all graphs H, and all positive integers t there exists a graph Rt(H) such that if the vertices of Rt(H) are colored with t colors, then there is an induced subgraph of Rt(H) isomorphic to H which is monochromatic.
    [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]
  • 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]
  • Strongly Regular Graphs
    MT5821 Advanced Combinatorics 1 Strongly regular graphs We introduce the subject of strongly regular graphs, and the techniques used to study them, with two famous examples. 1.1 The Friendship Theorem This theorem was proved by Erdos,˝ Renyi´ and Sos´ in the 1960s. We assume that friendship is an irreflexive and symmetric relation on a set of individuals: that is, nobody is his or her own friend, and if A is B’s friend then B is A’s friend. (It may be doubtful if these assumptions are valid in the age of social media – but we are doing mathematics, not sociology.) Theorem 1.1 In a finite society with the property that any two individuals have a unique common friend, there must be somebody who is everybody else’s friend. In other words, the configuration of friendships (where each individual is rep- resented by a dot, and friends are joined by a line) is as shown in the figure below: PP · PP · u P · u · " " BB " u · " B " " B · "B" bb T b ub u · T b T b b · T b T · T u PP T PP u P u u 1 1.2 Graphs The mathematical model for a structure of the type described in the Friendship Theorem is a graph. A simple graph (one “without loops or multiple edges”) can be regarded as a set carrying an irreflexive and symmetric binary relation. The points of the set are called the vertices of the graph, and a pair of points which are related is called an edge.
    [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]
  • Some Constructions of Small Generalized Polygons
    Journal of Combinatorial Theory, Series A 96, 162179 (2001) doi:10.1006Âjcta.2001.3174, available online at http:ÂÂwww.idealibrary.com on Some Constructions of Small Generalized Polygons Burkard Polster Department of Mathematics and Statistics, P.O. Box 28M, Monash University, Victoria 3800, Australia E-mail: Burkard.PolsterÄsci.monash.edu.au and Hendrik Van Maldeghem1 Pure Mathematics and Computer Algebra, University of Ghent, Galglaan 2, 9000 Gent, Belgium E-mail: hvmÄcage.rug.ac.be View metadata, citation and similarCommunicated papers at core.ac.uk by Francis Buekenhout brought to you by CORE provided by Elsevier - Publisher Connector Received December 4, 2000; published online June 18, 2001 We present several new constructions for small generalized polygons using small projective planes together with a conic or a unital, using other small polygons, and using certain graphs such as the Coxeter graph and the Pappus graph. We also give a new construction of the tilde geometry using the Petersen graph. 2001 Academic Press Key Words: generalized hexagon; generalized quadrangle; Coxeter graph; Pappus configuration; Petersen graph. 1. INTRODUCTION A generalized n-gon 1 of order (s, t) is a rank 2 point-line geometry whose incidence graph has diameter n and girth 2n, each vertex corre- sponding to a point has valency t+1 and each vertex corresponding to a line has valency s+1. These objects were introduced by Tits [5], who con- structed the main examples. If n=6 or n=8, then all known examples arise from Chevalley groups as described by Tits (see, e.g., [6, or 7]). Although these examples are strongly group-related, there exist simple geometric con- structions for large classes of them.
    [Show full text]
  • Dynamic Cage Survey
    Dynamic Cage Survey Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809, U.S.A. [email protected] Robert Jajcay Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809, U.S.A. [email protected] Department of Algebra Comenius University Bratislava, Slovakia [email protected] Submitted: May 22, 2008 Accepted: Sep 15, 2008 Version 1 published: Sep 29, 2008 (48 pages) Version 2 published: May 8, 2011 (54 pages) Version 3 published: July 26, 2013 (55 pages) Mathematics Subject Classifications: 05C35, 05C25 Abstract A(k; g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of searches for cages. We present the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions. the electronic journal of combinatorics (2013), #DS16 1 Contents 1 Origins of the Problem 3 2 Known Cages 6 2.1 Small Examples . 6 2.1.1 (3,5)-Cage: Petersen Graph . 7 2.1.2 (3,6)-Cage: Heawood Graph . 7 2.1.3 (3,7)-Cage: McGee Graph . 7 2.1.4 (3,8)-Cage: Tutte-Coxeter Graph . 8 2.1.5 (3,9)-Cages . 8 2.1.6 (3,10)-Cages . 9 2.1.7 (3,11)-Cage: Balaban Graph . 9 2.1.8 (3,12)-Cage: Benson Graph . 9 2.1.9 (4,5)-Cage: Robertson Graph . 9 2.1.10 (5,5)-Cages .
    [Show full text]
  • On Total Regularity of Mixed Graphs with Order Close to the Moore Bound
    On total regularity of mixed graphs with order close to the Moore bound James Tuite∗ Grahame Erskine ∗ [email protected] [email protected] Abstract The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of mixed graphs, i.e. networks that admit both undirected edges and directed arcs. The degree/diameter problem for mixed graphs asks for the largest possible order of a network with diameter k, maximum undirected degree r and maximum directed out-degree z. It is also of interest to find smallest ≤ ≤ possible k-geodetic mixed graphs with minimum undirected degree r and minimum directed ≥ out-degree z. A simple counting argument reveals the existence of a natural bound, the ≥ Moore bound, on the order of such graphs; a graph that meets this limit is a mixed Moore graph. Mixed Moore graphs can exist only for k = 2 and even in this case it is known that they are extremely rare. It is therefore of interest to search for graphs with order one away from the Moore bound. Such graphs must be out-regular; a much more difficult question is whether they must be totally regular. For k = 2, we answer this question in the affirmative, thereby resolving an open problem stated in a recent paper of L´opez and Miret. We also present partial results for larger k. We finally put these results to practical use by proving the uniqueness of a 2-geodetic mixed graph with order exceeding the Moore bound by one.
    [Show full text]
  • Lucky Labeling of Certain Cubic Graphs
    International Journal of Pure and Applied Mathematics Volume 120 No. 8 2018, 167-175 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ Special Issue http://www.acadpubl.eu/hub/ Lucky Labeling of Certain Cubic Graphs 1 2, D. Ahima Emilet and Indra Rajasingh ∗ 1,2 School of Advanced Sciences, VIT Chennai, India [email protected] [email protected] Abstract We call a mapping f : V (G) 1, 2, . , k , a lucky → { } labeling or vertex labeling by sum if for every two adjacent vertices u and v of G, f(v) = f(u). (v,u) E(G) 6 (u,v) E(G) The lucky number of a graph∈ G, denoted by η∈(G), is the P P least positive k such that G has a lucky labeling with 1, 2, . , k as the set of labels. Ali Deghan et al. [2] have { } proved that it is NP-complete to decide whether η(G) = 2 for a given 3-regular graph G. In this paper, we show that η(G) = 2 for certain cubic graphs such as cubic dia- mond k chain, petersen graph, generalized heawood graph, − G(2n, k) cubic graph, pappus graph and dyck graph. − AMS Subject Classification: 05C78 Key Words: Lucky labeling, petersen, generalized hea- wood, pappus, dyck 1 Introduction Graph coloring is one of the most studied subjects in graph theory. Recently, Czerwinski et al. [1] have studied the concept of lucky labeling as a vertex coloring problem. Ahadi et al. [3] have proved that computation of lucky number of planar graphs is NP-hard.
    [Show full text]
  • Crossing Number Graphs
    The Mathematica® Journal B E Y O N D S U D O K U Crossing Number Graphs Ed Pegg Jr and Geoffrey Exoo Sudoku is just one of hundreds of great puzzle types. This column pre- sents obscure logic puzzles of various sorts and challenges the readers to solve the puzzles in two ways: by hand and with Mathematica. For the lat- ter, solvers are invited to send their code to [email protected]. The per- son submitting the most elegant solution will receive a prize. ‡ The Brick Factory In 1940, the Hungarian mathematician Paul Turán was sent to a forced labor camp by the Nazis. Though every part of his life was brutally controlled, he still managed to do serious mathematics under the most extreme conditions. While forced to collect wire from former neighborhoods, he would be thinking about mathematics. When he found scraps of paper, he wrote down his theorems and conjectures. Some of these scraps were smuggled to Paul Erdős. One problem he developed is now called the brick factory problem. We worked near Budapest, in a brick factory. There were some kilns where the bricks were made and some open storage yards where the bricks were stored. All the kilns were connected to all the storage yards. The bricks were carried on small wheeled trucks to the storage yards. All we had to do was to put the bricks on the trucks at the kilns, push the trucks to the storage yards, and unload them there. We had a reasonable piece rate for the trucks, and the work itself was not difficult; the trouble was at the crossings.
    [Show full text]
  • New Large Graphs with Given Degree and Diameter ∗
    New Large Graphs with Given Degree and Diameter ∗ F.Comellas and J.G´omez Departament de Matem`aticaAplicada i Telem`atica Universitat Polit`ecnicade Catalunya Abstract In this paper we give graphs with the largest known order for a given degree ∆ and diameter D. The graphs are constructed from Moore bipartite graphs by replacement of some vertices by adequate structures. The paper also contains the latest version of the (∆,D) table for graphs. 1 Introduction A question of special interest in Graph theory is the construction of graphs with an order as large as possible for a given maximum de- gree and diameter or (∆,D)-problem. This problem receives much attention due to its implications in the design of topologies for inter- connection networks and other questions such as the data alignment problem and the description of some cryptographic protocols. The (∆,D) problem for undirected graphs has been approached in different ways. It is possible to give bounds to the order of the graphs for a given maximum degree and diameter (see [5]). On the other hand, as the theoretical bounds are difficult to attain, most of the work deals with the construction of graphs, which for this given diameter and maximum degree have a number of vertices as close as possible to the theoretical bounds (see [4] for a review). Different techniques have been developed depending on the way graphs are generated and their parameters are calculated. Many (∆,D) ∗ Research supported in part by the Comisi´onInterministerial de Ciencia y Tec- nologia, Spain, under grant TIC90-0712 1 graphs correspond to Cayley graphs [6, 11, 7] and have been found by computer search.
    [Show full text]
  • Spectra of Graphs
    Spectra of graphs Andries E. Brouwer Willem H. Haemers 2 Contents 1 Graph spectrum 11 1.1 Matricesassociatedtoagraph . 11 1.2 Thespectrumofagraph ...................... 12 1.2.1 Characteristicpolynomial . 13 1.3 Thespectrumofanundirectedgraph . 13 1.3.1 Regulargraphs ........................ 13 1.3.2 Complements ......................... 14 1.3.3 Walks ............................. 14 1.3.4 Diameter ........................... 14 1.3.5 Spanningtrees ........................ 15 1.3.6 Bipartitegraphs ....................... 16 1.3.7 Connectedness ........................ 16 1.4 Spectrumofsomegraphs . 17 1.4.1 Thecompletegraph . 17 1.4.2 Thecompletebipartitegraph . 17 1.4.3 Thecycle ........................... 18 1.4.4 Thepath ........................... 18 1.4.5 Linegraphs .......................... 18 1.4.6 Cartesianproducts . 19 1.4.7 Kronecker products and bipartite double. 19 1.4.8 Strongproducts ....................... 19 1.4.9 Cayleygraphs......................... 20 1.5 Decompositions............................ 20 1.5.1 Decomposing K10 intoPetersengraphs . 20 1.5.2 Decomposing Kn into complete bipartite graphs . 20 1.6 Automorphisms ........................... 21 1.7 Algebraicconnectivity . 22 1.8 Cospectralgraphs .......................... 22 1.8.1 The4-cube .......................... 23 1.8.2 Seidelswitching. 23 1.8.3 Godsil-McKayswitching. 24 1.8.4 Reconstruction ........................ 24 1.9 Verysmallgraphs .......................... 24 1.10 Exercises ............................... 25 3 4 CONTENTS 2 Linear algebra 29 2.1
    [Show full text]