Eigenspaces of Graphs: (Encyclopedia of Mathematics and its Applications)
By
Paperback
Available / dispatched within 1 - 2 weeks
Quantity
Description
Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic 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 labelling 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. One objective is to describe graphs by algebraic means as far as possible, and the book discusses the Ulam reconstruction conjecture and the graph isomorphism problem in this context. Further 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. 4 Tables, unspecified; 77 Line drawings, unspecified
More Details
- Contributor: Dragos Cvetkovic
- Imprint: Cambridge University Press
- ISBN13: 9780521057189
- Number of Pages: 276
- Packaged Dimensions: 156x234x15mm
- Packaged Weight: 398
- Format: Paperback
- Publisher: Cambridge University Press
- Release Date: 2008-03-01
- Series: Encyclopedia of Mathematics and its Applications
- Binding: Paperback / softback
Delivery Options
Home Delivery
Store Delivery
Free Returns
We hope you are delighted with everything you buy from us. However, if you are not, we will refund or replace your order up to 30 days after purchase. Terms and exclusions apply; find out more from our Returns and Refunds Policy.