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. Current research on this topic 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). 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. 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.*

US$ 66.00

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
CAMBRIDGE UNIVERSITY PRESS, United Kingdom
(2008)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2008. Paperback. Condition: New. Reissue. Language: English . Brand New Book ***** Print on Demand *****.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. Seller Inventory # AAV9780521057189

Published by
CAMBRIDGE UNIVERSITY PRESS, United Kingdom
(2008)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2008. Paperback. Condition: New. Reissue. Language: English . Brand New Book ***** Print on Demand *****. 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. Seller Inventory # AAV9780521057189

Published by
Cambridge University Press
(2008)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press, 2008. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780521057189

Published by
Cambridge University Press
(2008)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press, 2008. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9780521057189

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **2008. Paperback. Condition: NEW. 9780521057189 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0443226

Published by
Cambridge Univ Pr
(2008)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Cambridge Univ Pr, 2008. Paperback. Condition: Brand New. reissue edition. 258 pages. 9.25x6.25x0.50 inches. In Stock. Seller Inventory # __0521057183

Published by
Cambridge University Press
(2018)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: 17

Seller:

Rating

**Book Description **Cambridge University Press, 2018. Paperback. Condition: New. Never used! This item is printed on demand. Seller Inventory # 0521057183

Published by
Cambridge University Press

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press. Paperback. Condition: New. 276 pages. Dimensions: 9.1in. x 6.1in. x 0.9in.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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9780521057189

Published by
Cambridge University Press
(2008)

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Cambridge University Press, 2008. Paperback. Condition: New. Seller Inventory # DADAX0521057183

Published by
Cambridge University Press

ISBN 10: 0521057183
ISBN 13: 9780521057189

New
PAPERBACK
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press. PAPERBACK. Condition: New. 0521057183 Special order direct from the distributor. Seller Inventory # ING9780521057189