› › Isomorphisms Symmetry And Computations In Algebraic Graph Theory

Isomorphisms, Symmetry and Computations in Algebraic Graph Theory

Author : Gareth A. Jones

Publisher : Springer Nature

Page : 234 pages

File Size : 41,80 MB

Release : 2020-01-10

Category : Mathematics

ISBN : 3030328082

Get eBook

Book Description

This book consists of a selection of peer-reviewed contributions to the Workshop on Algebraic Graph Theory that took place in Pilsen, Czech Republic in October 2016. Primarily intended for early career researchers, it presents eight self-contained articles on a selection of topics within algebraic combinatorics, ranging from association schemes to symmetries of graphs and isomorphism testing. Algebraic combinatorics is a compelling mathematical discipline based on the powerful interplay of algebraic and combinatorial methods. Algebraic interpretation of combinatorial structures (such as symmetry or regularity) has often led to enlightening discoveries and powerful results, while discrete and combinatorial structures have given rise to new algebraic structures that have found valuable applications. In addition to these original research contributions, the reader will find a survey linking numerous threads in algebraic combinatorics, and an extensive tutorial showcasing the universality of algebraic methods in the study of combinatorial structures.





The Graph Isomorphism Algorithm

Author : Ashay Dharwadker

Publisher : Institute of Mathematics

Page : 42 pages

File Size : 44,61 MB

Release : 2009-08-08

Category : Mathematics

ISBN : 1466394374

Get eBook

Book Description

We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the algorithm is necessary and sufficient for solving the Graph Isomorphism Problem in polynomial-time, thus showing that the Graph Isomorphism Problem is in P. The semiotic theory for the recognition of graph structure is used to define a canonical form of the sign matrix of a graph. We prove that the canonical form of the sign matrix is uniquely identifiable in polynomial-time for isomorphic graphs. The algorithm is demonstrated by solving the Graph Isomorphism Problem for many of the hardest known examples. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.



Strongly Regular Graphs

Author : Andries E. Brouwer

Publisher : Cambridge University Press

Page : 482 pages

File Size : 41,98 MB

Release : 2022-01-13

Category : Mathematics

ISBN : 1009076841

Get eBook

Book Description

Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will refer to for years to come. The book covers the theory of strongly regular graphs, polar graphs, rank 3 graphs associated to buildings and Fischer groups, cyclotomic graphs, two-weight codes and graphs related to combinatorial configurations such as Latin squares, quasi-symmetric designs and spherical designs. It gives the complete classification of rank 3 graphs, including some new constructions. More than 100 graphs are treated individually. Some unified and streamlined proofs are featured, along with original material including a new approach to the (affine) half spin graphs of rank 5 hyperbolic polar spaces.



The Graph Isomorphism Problem

Author : J. Kobler

Publisher : Springer Science & Business Media

Page : 168 pages

File Size : 32,34 MB

Release : 2012-12-06

Category : Computers

ISBN : 1461203333

Get eBook

Book Description

Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the "Acciones In tegrada" program. The third author has been supported by the ESPRIT project ALCOM-II.



Encyclopaedia of Mathematics, Supplement III

Author : Michiel Hazewinkel

Publisher : Springer Science & Business Media

Page : 564 pages

File Size : 36,76 MB

Release : 2007-11-23

Category : Mathematics

ISBN : 0306483734

Get eBook

Book Description

This is the third supplementary volume to Kluwer's highly acclaimed twelve-volume Encyclopaedia of Mathematics. This additional volume contains nearly 500 new entries written by experts and covers developments and topics not included in the previous volumes. These entries are arranged alphabetically throughout and a detailed index is included. This supplementary volume enhances the existing twelve volumes, and together, these thirteen volumes represent the most authoritative, comprehensive and up-to-date Encyclopaedia of Mathematics available.



Symmetry in Graphs

Author : Ted Dobson

Publisher : Cambridge University Press

Page : 528 pages

File Size : 47,45 MB

Release : 2022-05-12

Category : Mathematics

ISBN : 1108643620

Get eBook

Book Description

This is the first full-length book on the major theme of symmetry in graphs. Forming part of algebraic graph theory, this fast-growing field is concerned with the study of highly symmetric graphs, particularly vertex-transitive graphs, and other combinatorial structures, primarily by group-theoretic techniques. In practice the street goes both ways and these investigations shed new light on permutation groups and related algebraic structures. The book assumes a first course in graph theory and group theory but no specialized knowledge of the theory of permutation groups or vertex-transitive graphs. It begins with the basic material before introducing the field's major problems and most active research themes in order to motivate the detailed discussion of individual topics that follows. Featuring many examples and over 450 exercises, it is an essential introduction to the field for graduate students and a valuable addition to any algebraic graph theorist's bookshelf.



Topics in Graph Automorphisms and Reconstruction

Author : Josef Lauri

Publisher : Cambridge University Press

Page : 176 pages

File Size : 29,17 MB

Release : 2003-03-17

Category : Mathematics

ISBN : 9780521529037

Get eBook

Book Description

The aim of this book is to provide in depth coverage of selected areas of graph theory, and throughout the focus is mainly on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters, more specialised topics are tackled, such as graphical regular representations and pseudosimilarity. The four final chapters are devoted to the reconstruction problem, and here greater emphasis is given to those results that involve the symmetry of graphs. As much as possible, the authors have tried to present results and proofs which are not often to be found in textbooks. Any student who has mastered the contents of this book will be well prepared for current research in many aspects of the theory of graph automorphisms and the reconstruction problem.



Graph Symmetry

Author : Gena Hahn

Publisher : Springer Science & Business Media

Page : 456 pages

File Size : 42,23 MB

Release : 1997-06-30

Category : Mathematics

ISBN : 9780792346685

Get eBook

Book Description

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.



Handbook of Combinatorics

Author : R.L. Graham

Publisher : Elsevier

Page : 1283 pages

File Size : 30,64 MB

Release : 1995-12-11

Category : Business & Economics

ISBN : 044488002X

Get eBook

Book Description