Download or read book Distance Regular Antipodal Covers of Johnson and Hamming Graphs written by J. T. M. van Bon and published by . This book was released on 1987 with total page 4 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Distance Regular Graphs written by Andries E. Brouwer and published by Springer. This book was released on 1989-07-14 with total page 530 pages. Available in PDF, EPUB and Kindle. Book excerpt: Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. 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. Several other important regular combinatorial structures are then shown to be equivalent to special families of distance-regular graphs. Other subjects of more general interest, such as regularity and extremal properties in graphs, association schemes, representations of graphs in euclidean space, groups and geometries of Lie type, groups acting on graphs, and codes are covered independently. Many new results and proofs and more than 750 references increase the encyclopaedic value of this book.
Download or read book Imprimitive Distance transitive Graphs written by Monther Rashed Furaidan and published by . This book was released on 2004 with total page 238 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Distance regular antipodal covers of strongly regular graphs written by Aleksandar Jurišić and published by . This book was released on 1990 with total page 73 pages. Available in PDF, EPUB and Kindle. Book excerpt: Antipodal distance regular covers of complete and complete bipartite graphs give rise to projective planes and Hadamard matrices. Inspired by this, we investigate antipodal distance regular covers of strongly regular graphs which are not complete bipartite. We use geometric properties of antipodal distance regular covers to show that infinite families of strongly regular graphs (Steiner graphs and latin square graphs) have no antipodal distance regular covers. This implies that for fixed integer $m$ only finitely many strongly regular graphs with the smallest eigenvalue $-m$ can have distance regular intipodal covers. We search for feasible parameters of strongly regular graphs with small valency (up to 100) and feasible parameters of their antipodal distance regular covers.
Download or read book Distance Regular Graphs written by Andries E. Brouwer and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 513 pages. Available in PDF, EPUB and Kindle. Book excerpt: Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. 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. Several other important regular combinatorial structures are then shown to be equivalent to special families of distance-regular graphs. Other subjects of more general interest, such as regularity and extremal properties in graphs, association schemes, representations of graphs in euclidean space, groups and geometries of Lie type, groups acting on graphs, and codes are covered independently. Many new results and proofs and more than 750 references increase the encyclopaedic value of this book.
Download or read book Regular Graphs written by Zoran Stanić and published by Walter de Gruyter GmbH & Co KG. This book was released on 2017-04-24 with total page 247 pages. Available in PDF, EPUB and Kindle. Book excerpt: Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs. The book begins with a short introduction including necessary terminology and notation. The author then proceeds with basic properties, specific subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders) and determining particular regular graphs. Each chapter contains detailed proofs, discussions, comparisons, examples, exercises and also indicates possible applications. Finally, the author also includes some conjectures and open problems to promote further research. Contents Spectral properties Particular types of regular graph Determinations of regular graphs Expanders Distance matrix of regular graphs
Download or read book Distance Regular Antipodal Covers of Strongly Regular Graphs written by Chris D. Godsil and published by Faculty of Mathematics, University of Waterloo. This book was released on 1990 with total page 45 pages. Available in PDF, EPUB and Kindle. Book excerpt: We use geometric properties of antipodal distance regular covers to show that infinite families of strongly regular graphs (Steiner graphs and latin square graphs) have no antipodal distance regular covers.
Download or read book Homotopy and Distance regular Graphs written by Heather Ames Lewis and published by . This book was released on 1997 with total page 174 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Distance regular Antipodal Covering Graphs written by Robert Ernest Lee Aldred and published by . This book was released on 1986 with total page 186 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Antipodal Distance regular Graphs written by Tilla Schade and published by . This book was released on 1994 with total page 131 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Combinatorics written by A. Hajnal and published by North Holland. This book was released on 1988 with total page 604 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Antipodal Distance Regular Graphs microform written by Andrew David Hensel and published by National Library of Canada. This book was released on 1988 with total page 86 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algebraic Combinatorics written by Chris Godsil and published by Routledge. This book was released on 2017-10-19 with total page 382 pages. Available in PDF, EPUB and Kindle. Book excerpt: This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.
Download or read book Graph Symmetry written by Gena Hahn and published by Springer Science & Business Media. This book was released on 2013-03-14 with total page 434 pages. Available in PDF, EPUB and Kindle. Book excerpt: The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs. In the design of large interconnection networks it was realised that many of the most fre quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.
Download or read book Antipodal Covers of Strongly Regular Graphs written by Jurǐsi ́c, Aleksandar and published by . This book was released on 1991 with total page 24 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book CWI Newsletter written by and published by . This book was released on 1984 with total page 830 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Journal of Algebraic Combinatorics written by and published by . This book was released on 1999 with total page 310 pages. Available in PDF, EPUB and Kindle. Book excerpt:
