Eigenvalues Multiplicities And Graphs
Download Eigenvalues Multiplicities And Graphs PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Eigenvalues Multiplicities And Graphs book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Eigenvalues, Multiplicities and Graphs
Author: Charles R. Johnson
language: en
Publisher: Cambridge University Press
Release Date: 2018-02-12
This book investigates the influence of the graph of a symmetric matrix on the multiplicities of its eigenvalues.
Spectra of Graphs
Author: Andries E. Brouwer
language: en
Publisher: Springer Science & Business Media
Release Date: 2011-12-17
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.
Graph Symmetry
Author: Gena Hahn
language: en
Publisher: Springer Science & Business Media
Release Date: 1997-06-30
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.