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 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 Algebraic Graph Theory written by Norman Biggs and published by Cambridge University Press. This book was released on 1993 with total page 220 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included at the end of each chapter, thereby covering most of the major advances in the last twenty years. Professor Biggs' basic aim remains to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first part, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject which has strong links with the 'interaction models' studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. This new and enlarged edition this will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.
Download or read book Distance Transitive Graphs of Valency Six written by Anthony Gardiner and published by . This book was released on 1985 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On Distance Transitive Graphs Whose Automorphism Groups are Affine written by Kazuhiro Yokoyama and published by . This book was released on 1988 with total page 34 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algebraic and Geometric Combinatorics written by E. Mendelsohn and published by Elsevier. This book was released on 1982-01-01 with total page 393 pages. Available in PDF, EPUB and Kindle. Book excerpt: Algebraic and Geometric Combinatorics
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 Handbook of Combinatorics written by R.L. Graham and published by Elsevier. This book was released on 1995-12-11 with total page 2404 pages. Available in PDF, EPUB and Kindle. Book excerpt: Handbook of Combinatorics
Download or read book Low Rank Representations and Graphs for Sporadic Groups written by Cheryl E. Praeger and published by Cambridge University Press. This book was released on 1996-12-05 with total page 157 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents a complete classification of the transitive permutation representations of rank at most five of the sporadic simple groups and their automorphism groups, together with a comprehensive study of the vertex-transitive graphs associated with these representations. Included is a list of all vertex-transitive, distance-regular graphs on which a sporadic almost simple group acts with rank at most five. In this list are some new, interesting distance-regular graphs of diameter two, which are not distance-transitive. For most of the representations a presentation of the sporadic group is given, with words in the given generators which generate a point stabiliser: this gives readers sufficient information to reconstruct and study the representations and graphs. Practical computational techniques appropriate for analysing finite vertex-transitive graphs are described carefully, making the book an excellent starting point for learning about groups and the graphs on which they act.
Download or read book Prospective classification of distance transitive graphs written by John T. M. van Bon and published by . This book was released on 1988 with total page 11 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Combinatorics 88 written by and published by . This book was released on 1991 with total page 476 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book On Distance Transitive Graphs Whose Automorphism Groups are Affine II written by Kazuhiro Yokoyama and published by . This book was released on 1991 with total page 23 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Canadian Journal of Mathematics written by and published by . This book was released on 1973-04 with total page 224 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 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 On Distance transitive Graphs and Involutions written by Jozef Theodorus Maria Bon and published by . This book was released on 1988 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Homogeneous Ordered Graphs Metrically Homogeneous Graphs and Beyond Volume 1 Ordered Graphs and Distanced Graphs written by Gregory Cherlin and published by Cambridge University Press. This book was released on 2022-06-30 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This is the first of two volumes by Professor Cherlin presenting the state of the art in the classification of homogeneous structures in binary languages and related problems in the intersection of model theory and combinatorics. Researchers and graduate students in the area will find in these volumes many far-reaching results and interesting new research directions to pursue. In this volume, Cherlin develops a complete classification of homogeneous ordered graphs and provides a full proof. He then proposes a new family of metrically homogeneous graphs, a weakening of the usual homogeneity condition. A general classification conjecture is presented, together with general structure theory and applications to a general classification conjecture for such graphs. It also includes introductory chapters giving an overview of the results and methods of both volumes, and an appendix surveying recent developments in the area. An extensive accompanying bibliography of related literature, organized by topic, is available online.
