An Introduction to the Theory of Graph Spectra

by
Edition: 1st
Format: Paperback
Pub. Date: 2009-11-16
Publisher(s): Cambridge University Press
  • Free Shipping Icon

    This Item Qualifies for Free Shipping!*

    *Excludes marketplace orders.

List Price: $41.99

Buy New

Arriving Soon. Will ship when available.
$39.99

Rent Textbook

Select for Price
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:180 Days access
Downloadable:180 Days
$65.28
Online:1825 Days access
Downloadable:Lifetime Access
$81.59
$65.28

Used Textbook

We're Sorry
Sold Out

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

This introductory text explores the theory of graph spectra: a topic with applications across a wide range of subjects, including computer science, quantum chemistry and electrical engineering. The spectra examined here are those of the adjacency matrix, the Seidel matrix, the Laplacian, the normalized Laplacian and the signless Laplacian of a finite simple graph. The underlying theme of the book is the relation between the eigenvalues and structure of a graph. Designed as an introductory text for graduate students, or anyone using the theory of graph spectra, this self-contained treatment assumes only a little knowledge of graph theory and linear algebra. The authors include many new developments in the field which arise as a result of rapidly expanding interest in the area. Exercises, spectral data and proofs of required results are also provided. The end-of-chapter notes serve as a practical guide to the extensive bibliography of over 500 items.

Table of Contents

Prefacep. ix
Introductionp. 1
Graph spectrap. 1
Some more graph-theoretic notionsp. 6
Some results from linear algebrap. 11
Exercisesp. 21
Notesp. 23
Graph operations and modificationsp. 24
Complement, union and join of graphsp. 24
Coalescence and related graph compositionsp. 29
General reduction proceduresp. 35
Line graphs and related operationsp. 38
Cartesian type operationsp. 43
Spectra of graphs of particular typesp. 46
Exercisesp. 49
Notesp. 51
Spectrum and structurep. 52
Counting certain subgraphsp. 52
Regularity and bipartitenessp. 55
Connectedness and metric invariantsp. 58
Line graphs and related graphsp. 60
More on regular graphsp. 65
Strongly regular graphsp. 70
Distance-regular graphsp. 76
Automorphisms and eigenspacesp. 80
Equitable partitions, divisors and main eigenvaluesp. 83
Spectral bounds for graph invariantsp. 87
Constraints on individual eigenvaluesp. 91
Exercisesp. 100
Notesp. 102
Characterizations by spectrap. 104
Speclial characterizations of certain classes of graphsp. 104
Cospectral graphs and the graph isomorphism problemp. 118
Characterizations by eigenvalues and anglesp. 126
Exercisesp. 133
Notesp. 134
Structure and one eigenvaluep. 136
Star complementsp. 136
Construction and characterizationp. 141
Bounds on multiplicitiesp. 150
Graphs with least eigenvalue-2p. 154
Graph foundationsp. 155
Exercisesp. 160
Notesp. 161
Spectral techniquesp. 162
Decompositions of complete graphsp. 162
Graph homomorphismsp. 165
The Friendship Theoremp. 167
Moore graphsp. 169
Generalized quadranglesp. 172
Equiangular linesp. 174
Counting walksp. 179
Exercisesp. 182
Notesp. 183
Laplaciansp. 184
The Laplacian spectrump. 184
The Matrix-Tree Theoremp. 189
The largest eigenvaluep. 193
Algebraic connectivityp. 197
Laplacian eigenvalues and graph structurep. 199
Expansionp. 208
The normalized Laplacian matrixp. 212
The signless Laplacianp. 216
Exercisesp. 225
Notesp. 226
Some additional resultsp. 228
More on graph eigenvaluesp. 228
Eigenvectors and structurep. 243
Reconstructing the characteristic polynomialp. 250
Integral graphsp. 254
Exercisesp. 257
Notesp. 258
Applicationsp. 259
Physicsp. 259
Chemistryp. 266
Computer sciencep. 273
Mathematicsp. 277
Notesp. 283
Appendixp. 285
The spectra and characteristic polynomials of the adjacency matrix, Seidel matrix, Laplacian and signless Laplacian for connected graphs with at most 5 verticesp. 286
The eigenvalues, angles and main angles of connected graphs with 2 to 5 verticesp. 290
The spectra and characteristic polynomials of the adjacency matrix for connected graphs with 6 verticesp. 294
The spectra and characteristic polynomials of the adjacency matrix for trees with at most 9 verticesp. 305
The spectra and characteristic polynomials of the adjacency matrix for cubic graphs with at most 12 verticesp. 316
Referencesp. 333
Index of symbolsp. 359
Index of termsp. 361
Table of Contents provided by Ingram. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.