Graph theory is an important branch of contemporary combinatorial mathematics. By describing recent results in algebraic graph theory and demonstrating how linear algebra can be used to tackle graph-theoretical problems, the authors provide new techniques for specialists in graph theory. The book explains 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 labeling 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 is part of a wider effort to forge closer links between algebra and combinatorics. 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" may belong to another edition of this title.
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).
"About this title" may belong to another edition of this title.
Seller: Betterbks/ COSMOPOLITAN BOOK SHOP, Burbank, CA, U.S.A.
Hardcover. Condition: Good. No Jacket. 1st Edition. 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. Seller Inventory # 301102A
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: Used - Very Good. Used - Like New Book. Shipped from UK. Established seller since 2000. Seller Inventory # P1-9780521573528
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 846446-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521573528
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 846446
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521573528_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 846446-n
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 846446
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: New. 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. Seller Inventory # 446940598
Quantity: 1 available
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521573528
Quantity: 1 available