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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
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).
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9780521057189
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780521057189_new
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. reissue edition. 258 pages. 9.25x6.25x0.50 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __0521057183
Cantidad disponible: 1 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. This book describes the spectral theory of finite graphs. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 276 pages, 77 b/w illus. 4 tables. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 15. Weight in Grams: 390. . 2008. Reissue. paperback. . . . . Nº de ref. del artículo: V9780521057189
Cantidad disponible: Más de 20 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Nº de ref. del artículo: C9780521057189
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 276. Nº de ref. del artículo: 26389141
Cantidad disponible: 4 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. This book describes the spectral theory of finite graphs. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 276 pages, 77 b/w illus. 4 tables. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 15. Weight in Grams: 390. . 2008. Reissue. paperback. . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9780521057189
Cantidad disponible: Más de 20 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 276 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 7491530
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 276. Nº de ref. del artículo: 18389151
Cantidad disponible: 4 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Paperback. Condición: new. Paperback. 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. 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. Specialists in graph theory will welcome this treatment of important new research. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9780521057189
Cantidad disponible: 1 disponibles