國立高雄大學圖資館 |

登入

回首頁

Locating eigenvalues in graphsalgorithms and applications /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Locating eigenvalues in graphsby Carlos Hoppen, David P. Jacobs, Vilmar Trevisan.
其他題名:	algorithms and applications /
作者:	Hoppen, Carlos.
其他作者:	Jacobs, David P.
出版者:	Cham :Springer International Publishing :2022.
面頁冊數:	xii, 136 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Eigenvalues.
電子資源:	https://doi.org/10.1007/978-3-031-11698-8
ISBN:	9783031116988$q(electronic bk.)

Locating eigenvalues in graphsalgorithms and applications /
Hoppen, Carlos.

Locating eigenvalues in graphsalgorithms and applications /[electronic resource] :by Carlos Hoppen, David P. Jacobs, Vilmar Trevisan. - Cham :Springer International Publishing :2022. - xii, 136 p. :ill. (some col.), digital ;24 cm. - SpringerBriefs in mathematics,2191-8201. - SpringerBriefs in mathematics..

Preface -- Introduction -- Preliminaries -- Locating Eigenvalues in Trees -- Graph Representations -- Locating Eigenvalues in Threshold Graphs and Cographs -- Locating Eigenvalues in Arbitrary Graphs -- Locating Eigenvalues in Distance Hereditary Graphs -- Some Other Algorithms -- References.

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.

ISBN: 9783031116988$q(electronic bk.)

Standard No.: 10.1007/978-3-031-11698-8doiSubjects--Topical Terms:

185326
Eigenvalues.

LC Class. No.: QA193 / .H66 2022

Dewey Class. No.: 512.9436

Locating eigenvalues in graphsalgorithms and applications /
LDR:03008nmm a2200337 a 4500 001 630681
003 DE-He213
005 20220921185054.0
006 m d
007 cr nn 008maaau
008 230329s2022 sz s 0 eng d
020 $a 9783031116988$q(electronic bk.)
020 $a 9783031116971$q(paper)
024 7 $a 10.1007/978-3-031-11698-8 $2 doi
035 $a 978-3-031-11698-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA193 $b .H66 2022
072 7 $a PBF $2 bicssc
072 7 $a MAT002050 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 512.9436 $2 23
090 $a QA193 $b .H798 2022
100 1 $a Hoppen, Carlos. $3 936012
245 1 0 $a Locating eigenvalues in graphs $h [electronic resource] : $b algorithms and applications / $c by Carlos Hoppen, David P. Jacobs, Vilmar Trevisan.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xii, 136 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a SpringerBriefs in mathematics, $x 2191-8201
505 0 $a Preface -- Introduction -- Preliminaries -- Locating Eigenvalues in Trees -- Graph Representations -- Locating Eigenvalues in Threshold Graphs and Cographs -- Locating Eigenvalues in Arbitrary Graphs -- Locating Eigenvalues in Distance Hereditary Graphs -- Some Other Algorithms -- References.
520 $a 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.
650 0 $a Eigenvalues. $3 185326
650 0 $a Graph theory. $3 181880
650 1 4 $a Linear Algebra. $3 821215
650 2 4 $a Graph Theory. $3 522732
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Applications of Discrete Mathematics. $3 922681
700 1 $a Jacobs, David P. $3 936013
700 1 $a Trevisan, Vilmar. $3 936014
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in mathematics. $3 558795
856 4 0 $u https://doi.org/10.1007/978-3-031-11698-8
950 $a Mathematics and Statistics (SpringerNature-11649)