Picture 1 of 9
Gallery
Picture 1 of 9
Have one to sell?
Eigenspaces of Graphs Cvetkovic Rowlinson Hardcover Encyclopedia of Mathematics
US $89.99
ApproximatelyS$ 115.38
Condition:
“Very nice condition with strong binding and clean crisp pages throughout. May have minor shelf wear. ”... Read moreabout condition
Very Good
A book that has been read but is in excellent condition. No obvious damage to the cover, with the dust jacket included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
US $5.97 (approx S$ 7.65) USPS Media MailTM.
Located in: Grandville, Michigan, United States
Delivery:
Estimated between Fri, 26 Sep and Tue, 30 Sep to 94104
Returns:
No returns accepted.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:336106295559
Item specifics
- Condition
- Very Good
- Seller Notes
- ISBN
- 9780521573528
About this product
Product Identifiers
Publisher
Cambridge University Press
ISBN-10
0521573521
ISBN-13
9780521573528
eBay Product ID (ePID)
685849
Product Key Features
Number of Pages
276 Pages
Publication Name
Eigenspaces of Graphs
Language
English
Publication Year
1997
Subject
Functional Analysis, Graphic Methods, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics
Series
Encyclopedia of Mathematics and Its Applications Ser.
Format
Hardcover
Dimensions
Item Height
0.9 in
Item Weight
18.9 Oz
Item Length
9.5 in
Item Width
6.4 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
96-002860
Reviews
"The overall level of writing is advanced, and the book is most suitable for research specialists in graph theory." Telegraphic Reviews, Specialists in graph theory and mathematical chemistry will welcome this treatment of important new research. European Mathematical Society, 'Specialists in graph theory and mathematical chemistry will welcome this treatment of important new research.' European Mathematical Society, ‘Specialists in graph theory and mathematical chemistry will welcome this treatment of important new research.’European Mathematical Society, 'Specialists in graph theory and mathematical chemistry will welcome this treatment of important new research.'European Mathematical Society
Dewey Edition
20
Series Volume Number
Series Number 66
Illustrated
Yes
Dewey Decimal
511.5
Table Of Content
1. A background in graph spectra; 2. Eigenvectors of graphs; 3. Eigenvectors of techniques; 4. Graph angles; 5. Angle techniques; 6. Graph perturbations; 7. Star partitions; 8. Canonical star bases; 9. Miscellaneous results.
Synopsis
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., 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.
LC Classification Number
QA166 .C83 1997
Item description from the seller
Popular categories from this store
Seller feedback (1,840)
- n***w (3829)- Feedback left by buyer.Past monthVerified purchaseAbsolutely Perfect! Thank You!
- eBay automated Feedback- Feedback left by buyer.Past monthOrder completed successfully – tracked and on time
- 2***n (2271)- Feedback left by buyer.Past monthVerified purchaseGood transaction, no problems. Thanks!
Popular categories from this store
Seller feedback (1,840)
- n***w (3829)- Feedback left by buyer.Past monthVerified purchaseAbsolutely Perfect! Thank You!
- eBay automated Feedback- Feedback left by buyer.Past monthOrder completed successfully – tracked and on time
- 2***n (2271)- Feedback left by buyer.Past monthVerified purchaseGood transaction, no problems. Thanks!