On The Classification Of Distance Regular Graphs By Eigenvalue Multiplicity
Download On The Classification Of Distance Regular Graphs By Eigenvalue Multiplicity full books in PDF, epub, and Kindle. Read online free On The Classification Of Distance Regular Graphs By Eigenvalue Multiplicity ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Peter Rowlinson |
| Publisher | : Cambridge University Press |
| Total Pages | : 243 |
| Release | : 1995 |
| Genre | : Combinatorial analysis |
| ISBN | : 0521497973 |
The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the meeting, and provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
| Author | : Andries E. Brouwer |
| Publisher | : |
| Total Pages | : 481 |
| Release | : 2022-01-13 |
| Genre | : Language Arts & Disciplines |
| ISBN | : 1316512037 |
This monograph on strongly regular graphs is an invaluable reference for anybody working in algebraic combinatorics.
| Author | : Andries E. Brouwer |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 513 |
| Release | : 2012-12-06 |
| Genre | : Mathematics |
| ISBN | : 3642743412 |
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.
| Author | : I.A. Faradzev |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 513 |
| Release | : 2013-06-29 |
| Genre | : Mathematics |
| ISBN | : 9401719721 |
X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of "sports-like" results were obtained. Some of these results are still unsurpassed.
| Author | : Stanley E. Payne |
| Publisher | : European Mathematical Society |
| Total Pages | : 304 |
| Release | : 2009 |
| Genre | : Mathematics |
| ISBN | : 9783037190661 |
Generalized quadrangles (GQ) were formally introduced by J. Tits in 1959 to describe geometric properties of simple groups of Lie type of rank 2. The first edition of Finite Generalized Quadrangles (FGQ) quickly became the standard reference for finite GQ. The second edition is essentially a reprint of the first edition. It is a careful rendering into LaTeX of the original, along with an appendix that brings to the attention of the reader those major new results pertaining to GQ, especially in those areas where the authors of this work have made a contribution. The first edition has been out of print for many years. The new edition makes available again this classical reference in the rapidly increasing field of finite geometries.
| Author | : Ravindra B. Bapat |
| Publisher | : Springer |
| Total Pages | : 197 |
| Release | : 2014-09-19 |
| Genre | : Mathematics |
| ISBN | : 1447165691 |
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reorganized. Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory, it will also benefit readers in the sciences and engineering.
| Author | : Paul Fong |
| Publisher | : American Mathematical Soc. |
| Total Pages | : 562 |
| Release | : 1987 |
| Genre | : Mathematics |
| ISBN | : 0821814788 |
The papers in these proceedings of the 1986 Arcata Summer Institute bear witness to the extraordinarily vital and intense research in the representation theory of finite groups. The confluence of diverse mathematical disciplines has brought forth work of great scope and depth. Particularly striking is the influence of algebraic geometry and cohomology theory in the modular representation theory and the character theory of reductive groups over finite fields, and in the general modular representation theory of finite groups. The continuing developments in block theory and the general character theory of finite groups is noteworthy. The expository and research aspects of the Summer Institute are well represented by these papers.
| Author | : Andries E. Brouwer |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 254 |
| Release | : 2011-12-17 |
| Genre | : Mathematics |
| ISBN | : 1461419395 |
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics. Exercises at the end of each chapter provide practice and vary from easy yet interesting applications of the treated theory, to little excursions into related topics. Tables, references at the end of the book, an author and subject index enrich the text. Spectra of Graphs is written for researchers, teachers and graduate students interested in graph spectra. The reader is assumed to be familiar with basic linear algebra and eigenvalues, although some more advanced topics in linear algebra, like the Perron-Frobenius theorem and eigenvalue interlacing are included.
| Author | : |
| Publisher | : |
| Total Pages | : 388 |
| Release | : 1996 |
| Genre | : Combinatorial analysis |
| ISBN | : |
| Author | : D.M. Cvetkovic |
| Publisher | : Elsevier |
| Total Pages | : 319 |
| Release | : 1988-01-01 |
| Genre | : Mathematics |
| ISBN | : 0080867766 |
The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978.The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden subgraph techniques as well as geometric methods involving root systems. In the meantime, the particular problem giving rise to these methods has been solved almost completely. This is indicated in Chapter 1.The study of various combinatorial objects (including distance regular and distance transitive graphs, association schemes, and block designs) have made use of eigenvalue techniques, usually as a method to show the nonexistence of objects with certain parameters. The basic method is to construct a graph which contains the structure of the combinatorial object and then to use the properties of the eigenvalues of the graph. Methods of this type are given in Chapter 2.Several topics have been included in Chapter 3, including the relationships between the spectrum and automorphism group of a graph, the graph isomorphism and the graph reconstruction problem, spectra of random graphs, and the Shannon capacity problem. Some graph polynomials related to the characteristic polynomial are described in Chapter 4. These include the matching, distance, and permanental polynomials. Applications of the theory of graph spectra to Chemistry and other branches of science are described from a mathematical viewpoint in Chapter 5. The last chapter is devoted to the extension of the theory of graph spectra to infinite graphs.
