Millions of books in English, Spanish and other languages. Free UK delivery 

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Locating Eigenvalues in Graphs: Algorithms and Applications
Type
Physical Book
Publisher
Language
English
Pages
136
Format
Paperback
Dimensions
23.4 x 15.6 x 0.8 cm
Weight
0.22 kg.
ISBN13
9783031116971

Locating Eigenvalues in Graphs: Algorithms and Applications

Carlos Hoppen (Author) · David P. Jacobs (Author) · Vilmar Trevisan (Author) · Springer · Paperback

Locating Eigenvalues in Graphs: Algorithms and Applications - Hoppen, Carlos ; Jacobs, David P. ; Trevisan, Vilmar

Physical Book

£ 60.70

  • Condition: New
Origin: U.S.A. (Import costs included in the price)
It will be shipped from our warehouse between Tuesday, June 18 and Monday, July 01.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.

Synopsis "Locating Eigenvalues in Graphs: Algorithms and Applications"

This book focuses on linear time eigenvalue location algorithms for graphs. This subject relates to spectral graph theory, a field that combines tools and concepts of linear algebra and combinatorics, with applications ranging from image processing and data analysis to molecular descriptors and random walks. It has attracted a lot of attention and has since emerged as an area on its own.Studies in spectral graph theory seek to determine properties of a graph through matrices associated with it. It turns out that eigenvalues and eigenvectors have surprisingly many connections with the structure of a graph. This book approaches this subject under the perspective of eigenvalue location algorithms. These are algorithms that, given a symmetric graph matrix M and a real interval I, return the number of eigenvalues of M that lie in I. Since the algorithms described here are typically very fast, they allow one to quickly approximate the value of any eigenvalue, which is a basic step in most applications of spectral graph theory. Moreover, these algorithms are convenient theoretical tools for proving bounds on eigenvalues and their multiplicities, which was quite useful to solve longstanding open problems in the area. This book brings these algorithms together, revealing how similar they are in spirit, and presents some of their main applications.This work can be of special interest to graduate students and researchers in spectral graph theory, and to any mathematician who wishes to know more about eigenvalues associated with graphs. It can also serve as a compact textbook for short courses on the topic.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews