Graph theory is an important branch of contemporary combinatorial mathematics. By describing recent results in algebraic graph theory and demonstrating how linear algebra can be used to tackle graph-theoretical problems, the authors provide new techniques for specialists in graph theory. The book explains how the spectral theory of finite graphs can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labeling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. Current research on these topics is part of a wider effort to forge closer links between algebra and combinatorics. Problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.

Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications, Series Number 66)

Reference

Cvetković, Dragoš

Rowlinson, Peter

Simić, Slobodan

Encyclopedias & Subject Guides

Cambridge University Press

An Introduction to the Theory of Graph Spectra (London Mathematical Society Student Texts, Series Number 75)

This introductory text explores the theory of graph spectra: a topic with applications across a wide range of subjects, including computer science, quantum chemistry and electrical engineering. The spectra examined here are those of the adjacency matrix, the Seidel matrix, the Laplacian, the normalized Laplacian and the signless Laplacian of a finite simple graph. The underlying theme of the book is the relation between the eigenvalues and structure of a graph. Designed as an introductory text for graduate students, or anyone using the theory of graph spectra, this self-contained treatment assumes only a little knowledge of graph theory and linear algebra. The authors include many new developments in the field which arise as a result of rapidly expanding interest in the area. Exercises, spectral data and proofs of required results are also provided. The end-of-chapter notes serve as a practical guide to the extensive bibliography of over 500 items.

Science & Math

Mathematics

<p>This introductory text explores the theory of graph spectra: a topic with applications across a wide range of subjects, including computer science, quantum chemistry and electrical engineering. The spectra examined here are those of the adjacency matrix, the Seidel matrix, the Laplacian, the normalized Laplacian and the signless Laplacian of a finite simple graph. The underlying theme of the book is the relation between the eigenvalues and structure of a graph. Designed as an introductory text for graduate students, or anyone using the theory of graph spectra, this self-contained treatment assumes only a little knowledge of graph theory and linear algebra. The authors include many new developments in the field which arise as a result of rapidly expanding interest in the area. Exercises, spectral data and proofs of required results are also provided. The end-of-chapter notes serve as a practical guide to the extensive bibliography of over 500 items.</p>

<p>Graph theory is an important branch of contemporary combinatorial mathematics. By describing recent results in algebraic graph theory and demonstrating how linear algebra can be used to tackle graph-theoretical problems, the authors provide new techniques for specialists in graph theory. The book explains how the spectral theory of finite graphs can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labeling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. Current research on these topics is part of a wider effort to forge closer links between algebra and combinatorics. Problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.</p>

An essential reference source of definitions and explanations of agricultural terms, this book is intended for agricultural students, farmers and administrators.

The Agricultural Handbook: A Guide to Terminology

Whitby, Martin

Topham, Michael

Younger, Alan

UNKNO

See the best price to sell, buy, or rent books by Rowlinson, Peter. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Rowlinson, Peter

See the best price to sell, buy, or rent books by Rowlinson, Peter. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications, Series Number 66)

An Introduction to the Theory of Graph Spectra (London Mathematical Society Student Texts, Series Number 75)

An Introduction to the Theory of Graph Spectra (London Mathematical Society Student Texts, Series Number 75)

Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications, Series Number 66)

The Agricultural Handbook: A Guide to Terminology