There is no closed formula that anyone knows of, but there are asymptotic results, due to bollobas, see a probabilistic proof of an asymptotic formula for the number of labelled regular. Weaker students do not need to complete each step before moving on to the next question. Distanceregular subgraphsin a distanceregular graph, i. Distanceregular graphs 5 two case, but we are of the opinion that they form a subject of their own.
A new family of distanceregular graphs with unbounded. Parallelogramfree distanceregular graphs sciencedirect. The corresponding tables for the case of bipartite graphs of diameter 4 were given in the pdf. Mathematics free fulltext on the generalized distance. Starting from very elementary regularity properties, the concept of a distanceregular graph arises naturally as a common setting for regular graphs which are extremal in one sense or another. We study the relation between distanceregular graphs and. Special regular graphs association schemes representation theory theory of distanceregular graphs parameter restrictions for distanceregular graphs classification of the known. Part ii create a distance vs time graph 1 a helicopter left the landing pad at the top of a skyscraper and then quickly flew downwards towards the ground and maintained a 5 foot. Parallelogramfree distanceregular graphs yuhjeng liang and chihwen weng department of applied mathematics, national chiao tung university, taiwan, republic of china received. Several other important regular combinatorial structures are then shown to be equivalent to special families of distanceregular graphs. Also in the study of graphs, distances have played a central role throughout. The wellknown petersen graph is a distanceregular graph with diameter 2, and has in. This interplay between regularity and symmetry properties of graphs is the theme of this book.
Starting from very elementary regularity properties, the concept of a distance regular graph arises naturally as a common setting for regular graphs which are extremal in one sense or another. In particular, we prove that such a graph is isomorphic to a. Nonetheless, there are many constructions of such graphs in the literature 26, 41, 42, most notably those derived from distanceregular graphs 9 and from association schemes. It is trianglefree and has at most five distinct eigenvalues. An imprimitive distanceregular graph is either antipodal or bipartite. The concept of distance pervades all of science and mathematics, and even our daily lives. Folge a series of modern surveys in mathematics on free shipping on qualified orders. Arnold neumaier ever since the discovery of the five platonic solids in ancient times, the study of. Distanceregular graphs open problems characterizations about our proof distancetransitive graphs distanceregular graphs were introduced by biggs in the late 1960s as a combinatorial.
A questionable distanceregular graph rebecca ross abstract in this paper, we introduce distanceregular graphs and develop the intersection algebra for these graphs which is based. If this is the first time you use this feature, you will be asked to authorise cambridge core to connect with your account. The big project of classifying distanceregular graphs. As a natural generalization of distanceregular graphs see 3, 4 for the theory of distanceregular graphs, wang and suzuki 6 introduced the concept of weakly distanceregular digraphs. Review article distance degree regular graphs and distance degree injective graphs.
Name date period distancetime graphs describing the motion of an object is occasionally hard to do with words. We give necessary and sufficient conditions for the neighbourhood. Then we will look at distanceregular graphs, determine for all known ones whether they are 3chromatic, and make a start with the classification of all 3chromatic distanceregular graphs. Review article distance degree regular graphs and distance. Line graphs are used to track changes over short and long periods of time. This worksheet allows students to build up their skills step by step. Parallelogramfree distanceregular graphs, journal of. One of the highlights is that electric resistance and hitting times between. Pdf triangle and pentagonfree distanceregular graphs. An overview medhaitagihuilgol department of mathematics, bangalore university, central college. Read parallelogramfree distanceregular graphs, journal of combinatorial theory, series b on deepdyve, the largest online rental service for scholarly research with thousands of academic. Starting from very elementary regularity properties, the concept of a distanceregular graph. In this paper we prove that there are finitely many trianglefree distanceregular graphs with degree 8, 9 or 10. We classify triangle and pentagonfree distanceregular graphs with diameter d.
Since all distance regular graphs are transmission regular graphs, by lemma 9, equality occurs in theorems 5 and 6 for each of the graphs. Distance time graphs step by step worksheet differentiated. Distanceregular graphs are graphs with a lot of combinatorial symmetry, in the sense that given an arbitrary ordered pair of vertices at distance h, the number of vertices that are at distance. A survey is presented of known results concerning simple random walk on the class of distanceregular graphs. A large portion of the paper is based on exercises and questions. In particular, we prove that such a graph is isomorphic to a cycle, a kcube, a complete bipartite graph minus a. The distance degree sequence dds of a vertex v in a graph g v, e is a list of the number of vertices at distance 1, 2. When smaller changes exist, line graphs are better to use than bar graphs. Interpretation of motion graphs page 1 of 2 fdhs physics distancetime graph a distancetime graph tells us how far an object has moved with time, using the fundamental motion equation. Distanceregular graphs and halved joe hemmeter let g be a bipartite distanceregular graph with bipartition v g xu y. Bcn tables in bcn tables for feasible parameter sets for distanceregular graphs on at most 4096 vertices were given. The distanceregular graphs with diameter 2 are very special, and form a subject of their own. Let g x and, for x and y in x, let be adjacent to y g if only is of. On vertex decomposable and cohenmacaulay regular graphs luviano, j.
Simply explained alexander coulter paauwe april 20, 2007. Department of applied mathematics national chiao tung university taiwan. In mathematics, a distanceregular graph is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k, and. A separate survey of strongly regular graphs would therefore be warmly welcomed. Bipartite distanceregular graphs with an eigenvalue of multiplicity equal to the valency have alreadybeenclassi. Permission is granted to copy, distribute andor modify this document under the terms of the gnu free.
This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. Sometimes graphs help make motion easier to picture, and. Pdf distance degree regular graphs and distance degree. We believe that to find nice distanceregular subgraphs in a distanceregular graph will be a key for the classification of distanceregular graphs.
451 1055 124 516 1206 1152 1327 797 929 1145 1276 1160 1145 1273 263 901 1484 1597 461 326 758 714 854 975 518 722 373 1357 474 1607 1153 1372 788 533 1094 413 881 441 255 1260 1131 1043 751 694 597 1130