Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications Series - Number 66). Cet article n’est pas disponible.
Langue : anglais
Edité par Cambridge University Press, 1997
Série : Livre 49 sur 188 - Encyclopedia of Mathematics and its Applications
- Éd. originale
- Livre relié
- Occasion
Partenaire historique
Vendeur : Betterbks/ COSMOPOLITAN BOOK SHOP, Burbank, CA, Etats-UnisBetterbks/ COSMOPOLITAN BOOK SHOP
Vendeur avec une évaluation de 5 étoiles
Vendeur AbeBooks depuis 9 mars 1999
Indisponible
Livre relié
Etat: Occasion - Satisfaisant
EUR 32,36
A propos de cet article
Octavo. Diagrams. Condition: ex-library copy with library markings; two-inch split to middle of front outer hinge; binding sun-faded with minor wear; else good. Pages: xiii, 258.
N° de réf. du vendeur 301102A
- Titre
- Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications Series - Number 66)
- Auteur
- Cvetkovic, Dragos; Rowlinson, Peter; Simic, Slobodan
- Éditeur
- Cambridge University Press
- Année de publication
- 1997
- État de l'article
- Good
- Jaquette
- No Jacket
- Reliure
- Hardcover
- Langue
- anglais
- ISBN à 10 chiffres
- 0521573521
- ISBN à 13 chiffres
- 9780521573528
- Édition
- 1st Edition
- Poids de l'article
- 2 livres
- Série
- Livre 49 sur 188: Encyclopedia of Mathematics and its Applications
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.
« Synopsis » peut appartenir à une autre édition de cet ouvrage.
Présentation de l'éditeur
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.
« A propos de ce titre » peut appartenir à une autre édition de cet ouvrage.