Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non. The gewirtz graph is a strongly regular graph with parameters 56,10,0,2. Implementing brouwers database of strongly regular graphs. For triangular imbeddings of strongly regular graphs, we readily obtain analogs to theorems 123 and 124. Over the years i have been attempting to classify all strongly regular graphs with few vertices and have achieved some success in the area of. We do not want to get into details, but the knowledgeable reader may observe that a strongly regular graph is essentially the same as an association scheme of class 2 see 154,329. A strongly regular graph is isomorphic to the pointgraph of. Pasechnik 0 1 0 department of computer science, the university of oxford, oxford, uk 1 cnrs and universite parissud 11, orsay, france andries brouwer maintains a public database of existence results for strongly regular graphs on n. A proof that f and g, the dimensions of the eigenspaces, are.
A design is said to be connected if its underlying graph is connected. Conversely, a quasisymmetric or strongly regular design with suitable param eters gives rise to a strongly regular graph with strongly regular decomposi tion. Construction of directed strongly regular graphs references some families of directed strongly regular graphs obtained from certain finite incidence structures oktay olmez department of mathematics iowa state university 24th cumberland conference on combinatorics, graph theory, and computing may 12, 2011 7. Vg in the srnt graph g the adjacency matrix a of g in partition form is. Pech on highly regular strongly regular graphs june 2014 15 20.
In fact, we shall need to assume k strongly regular graph of degree k with n 29 vertices and zero. On the distance spectra of graphs iowa state university. This confirms and strengthens a conjecture of cameron and kazanidis that all. Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or nonadjacent. Conditions on the parameters let g be a strongly regular graph with parameters n,k, and adjacency matrix a. G is said to be strongly regular if there are also integers. Conversely, a connected regular graph with only three eigenvalues is strongly regular. Pech on highly regular strongly regular graphs june. For example, the graph above is 2regular, and the graph below called the petersen graph is 3regular. In this paper, strongly regular fuzzy graph which is analogous to the concept of strongly regular graph in crisp graph theory is introduced and examples are presented, necessary and sufficient condition for a cycle to be strongly regular fuzzy graph is provided and some properties of strongly regular fuzzy graph are studied. Since the eigenvalues of every bipartite graph are symmetric about the origin, we conclude that if g 7 iir2 is a strongly fcregular graph, then a. Definition of strongly regular graphs mathematics stack. On generalized binomial series and strongly regular graphs.
From an algebraic point of view, a graph is strongly regular if its adjacency matrix has exactly three eigenvalues. A graph is called kregular if every vertex has degree k. A weighted graph or a network is a graph in which a number the weight is assigned to each edge. Implementing brouwers database of strongly regular graphs nathann cohen 0 1 dmitrii v. On the clique number of a strongly regular graph arxiv. A graph of this kind is sometimes said to be an srgv, k. In fact, we shall need to assume k pdf available in designs codes and cryptography 17.
A ne planes, groupdivisible designs, partial geometries. So a srg strongly regular graph is a regular graph in which the number of common neighbours of a pair of vertices depends only on whether that pair forms an edge or not. Spectral graph theory lecture 24 strongly regular graphs, part 2 daniel a. Subgraphs of strongly regular graphs 2263 2 main results by. Pasechnik 0 1 0 department of computer science, the university of oxford, oxford, uk 1. Over the years i have been attempting to classify all strongly regular graphs with few vertices and have achieved some success in the area of complete classification in two cases that were previously unknown. A kregular graph of order nis strongly regular with parameters n. Cane year later, higman 34 initiated the study of the rank 3 permutation groups using the strongly regular graphs. Haemers at the intensive course on finite geometry and applications. Pdf a spectral proof of the uniqueness of a strongly. The result is obtained by a mix of algebraic and computational approaches. Therefore, the only endomorphisms of a primitive strongly regular graph are automorphisms or colorings. A complete multipartite graph is strongly regular i. Let g v, e be a regular graph with v vertices and degree k.
Then the x,y entry of a 2 is the number of vertices adjacent to x and y. Higman 14, except possibly when r, is the graph of a regular conference matrix. A note on order and eigenvalue multiplicity of strongly. First we will show for that x, a connected strongly regular graph. By a result of 1, any such strongly regular graph whenever f 6 7 is. This confirms and strengthens a conjecture of cameron and kazanidis that all strongly regular graphs are cores or have complete cores. Haemers at the intensive course on finite geometry and applications, university of ghent, april 314, 2000. For example, the graph above is 2 regular, and the graph below called the petersen graph is 3 regular. Throughout this paper n denotes the number of vertices of a fuzzy graph and edge between u and v is denoted as uv. Any vertextransitive graph with a rankthree automorphism group is strongly.
Such weights might represent for example costs, lengths or capacities, depending on the. An nvertex graph g is called strongly bi regular, denoted sbrgn, r, s. A nonnull and not complete graph x is nkac,,strongly regular. Reader for the lectures matrix techniques for strongly. Strongly regular graphs with strongly regular decomposition. Parameters of strongly regular graphs below tables with parameters for strongly regular graphs. Strongly regular graphs have long been one of the core topics of interest in algebraic graph theory. First we will show for that x, a connected strongly regular graph with parameters n. The uvth entry of a2 is the number of walks of length 2 from uto v. A strongly regular graph is isomorphic to the pointgraph of a pq if and only if it does not contain a subgraph isomorphic to k4. We have seen that the eigenvalues of g occur with multiplicities 1,m1 1 2 n. This number is k, according as x and y are equal, adjacent or nonadjacent. The class of strongly regular graphs, while not believed to be gicomplete, has long been identi.
Mathematics stack exchange is a question and answer site for people studying math at any level and professionals in related fields. Strongly regular graph an overview sciencedirect topics. If g is a strongly regular graph which is not a complete graph, then it has three distinct eigenvalues, 7, p. Any vertextransitive graph with a rankthree automorphism group is strongly regular, and we have already met several such graphs, including the petersen graph, the hoffmansingleton graph, and the symplectic graphs of section 8. A graph sometimes called undirected graph for distinguishing from a directed graph, or simple graph for distinguishing from a multigraph is a pair g v, e, where v is a set whose elements are called vertices singular. Generalized krein parameters of a strongly regular graph. Since the eigenvalues of every bipartite graph are symmetric about the. A connected strongly regular graph with connected complement is just a distance regular graph of diameter two. Pdf on generalized binomial series and strongly regular. An nvertex graph g is called strongly biregular, denoted sbrgn, r, s. Binary codes of strongly regular graphs article pdf available in designs codes and cryptography 17. Additional examples of optimistic strongly regular graphs, such as the halljanko graph with parameters 100, 36, 14, 12, and examples of optimistic graphs that. There are 168 hyperovals in this projective plane and they can be.
On the automorphism groups of strongly regular graphs. In graph theory, a strongly regular graph is defined as follows. We determine these codes for some families of graphs, e pay attention to the relation beteen the codes of switching equivalent graphs and, ith the exception of two parameter sets, we generate by computer the codes of all knon strongly regular graphs on fewer than 45 vertices. A k regular graph of order nis strongly regular with parameters n. A connected strongly regular graph with connected complement is just a distanceregular graph of diameter two. A connected regular graph xis strongly regular if and only if it has exactly 3 distinct eigenvalues. There are 168 hyperovals in this projective plane and they can be partitioned into three classes of 56 hyperovals apiece with the property that two hyperovals belong to the same class iff they intersect in an even number. It is a graphical representation of a symmetric relation. We determine these codes for some families of graphs, e pay. Introduction the theory of strongly regular graphs s. Strongly regular graphs eindhoven university of technology. Up strongly regular graphs a graph is a collection of points, where certain pairs of points are joined by an edge. So a srg strongly regular graph is a regular graph in which the number of common neighbours of a pair of vertices depends only on whether that pair forms an edge or.
Some families of directed strongly regular graphs obtained. A graph is called k regular if every vertex has degree k. Spectral graph theory lecture 23 strongly regular graphs, part 1 daniel a. In this paper, strongly regular fuzzy graph which is analogous to the concept of strongly regular graph in crisp graph theory is introduced and examples are presented, necessary and sufficient. This is again a standard result see cameron and van lint 9, chapter 2. Binary codes of strongly regular graphs springerlink. Introduction and preliminaries directed strongly regular graphs. On the automorphism groups of strongly regular graphs i. Reader for the lectures matrix techniques for strongly regular graphs and related geometries presented by willem h. Construction of directed strongly regular graphs references some families of directed strongly regular graphs obtained from certain finite incidence structures oktay olmez department of. The proof of the result is elementary, mainly relying on linear algebraic techniques. A spectral proof of the uniqueness of a strongly regular graph with parameters 81, 20, 1, 6. For example, their adjacency matrices have only three distinct eigenvalues.
646 967 594 1380 34 244 228 1345 124 1058 313 440 263 1543 178 713 1530 930 660 588 428 1091 370 733 623 957 773 640 470 399 108 902 85 1424 221