Description 
xiii, 258 pages : illustrations ; 24 cm 
Series 
Encyclopedia of mathematics and its applications ; v. 66 

Encyclopedia of mathematics and its applications ; v. 66

Contents 
1. A background in graph spectra  2. Eigenvectors of graphs  3. Eigenvector techniques  4. Graph angles  5. Angle techniques  6. Graph perturbations  7. Star partitions  8. Canonical star bases  9. Miscellaneous results  App. A. Some results from matrix theory  App. B. A table of graph angles 
Summary 
This book describes 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 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. Current research on these topics 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) 
Bibliography 
Includes bibliographical references (pages 239255) and index 
Notes 
Encyclopedia of mathematics and its applications no:66 09534806 
Subject 
Eigenvectors.


Graph theory.


Spectral theory (Mathematics)

Author 
Rowlinson, Peter.


Simić, S. (Slobodan)

LC no. 
96002860 
ISBN 
0521573521 (hardback) 
