Isbn: 9780521057189 - eom: 66 eigenspaces of graphs (encyclopedia of mathematics and its applications, 66, band 66) (3 Ergebnisse)

Sprache: Englisch
Verlag: Cambridge University Press, 2008
Serie: Buch 49 von 188 - Encyclopedia of Mathematics and its Applications
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 75,62
EUR 13,14 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.

Sprache: Englisch
Verlag: Cambridge University Press, 2008
Serie: Buch 49 von 188 - Encyclopedia of Mathematics and its Applications
- Softcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 99,22
EUR 9,04 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: 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. …

Sprache: Englisch
Verlag: Cambridge University Press, 2008
Serie: Buch 49 von 188 - Encyclopedia of Mathematics and its Applications
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 108,50
EUR 30,50 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…