Amazon.com: Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications) (9780521573528): Dragos Cvetkovic, Peter Rowlinson, Slobodan Simic: Books


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Eigenspaces of Graphs (Encyclopedia of Mathematics and its Applications) [Hardcover]

Dragos Cvetkovic (Author), Peter Rowlinson (Author), Slobodan Simic (Author)

List Price: $151.00
Price: $147.23 & this item ships for FREE with Super Saver Shipping. Details
You Save: $3.77 (2%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Monday, February 27? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Hardcover $147.23  
Paperback $54.85  

Book Description

January 28, 1997 0521573521 978-0521573528
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.

Customers Who Viewed This Item Also Viewed


Editorial Reviews

Review

"The overall level of writing is advanced, and the book is most suitable for research specialists in graph theory." Telegraphic Reviews

Book Description

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.

Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
First Sentence:
In Section 1.1 we introduce notation and terminology which will be used throughout the book. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
star partition, canonical star basis, cospectral graphs, cospectral vertices, cospectral regular graphs, same main angles, stepwise adjacency matrix, perturbed graph, unicyclic graphs, main eigenvalue, cospectral pairs, canonical vertex, isospectral graphs, stepwise matrix, generalized direct product, minimal forbidden subgraphs, pendant edge, graph angles, graph isomorphism problem, strongly regular graph, reconstruction conjecture, star cell, angle matrix, graph perturbations, graph spectra
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Let, Proposition Let, Proof Suppose, Example Let, Reconstruction Lemma, Definition Let, Reconstruction Theorem, Remark Let, Corollary Let, Lloyd's Theorem, Proof By Lemma
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Search Inside This Book:





Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject