國立虎尾科技大學 |

Locating Eigenvalues in Graphs = Algorithms and Applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Locating Eigenvalues in Graphs/ by Carlos Hoppen, David P. Jacobs, Vilmar Trevisan.
其他題名:	Algorithms and Applications /
作者:	Hoppen, Carlos.
其他作者:	Jacobs, David P.
面頁冊數:	XII, 136 p. 37 illus., 25 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algebras, Linear. -
電子資源:	https://doi.org/10.1007/978-3-031-11698-8
ISBN:	9783031116988

Locating Eigenvalues in Graphs = Algorithms and Applications /
Hoppen, Carlos.

Locating Eigenvalues in GraphsAlgorithms and Applications /[electronic resource] :by Carlos Hoppen, David P. Jacobs, Vilmar Trevisan. - 1st ed. 2022. - XII, 136 p. 37 illus., 25 illus. in color.online resource. - 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

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

528115
Algebras, Linear.

LC Class. No.: QA184-205

Dewey Class. No.: 512.5

Locating Eigenvalues in Graphs = Algorithms and Applications /
LDR:03329nam a22003975i 4500 001 1083405
003 DE-He213
005 20220921185054.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031116988 $9 978-3-031-11698-8
024 7 $a 10.1007/978-3-031-11698-8 $2 doi
035 $a 978-3-031-11698-8
050 4 $a QA184-205
072 7 $a PBF $2 bicssc
072 7 $a MAT002050 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 512.5 $2 23
100 1 $a Hoppen, Carlos. $e author. $0 (orcid)0000-0002-7581-1583 $1 https://orcid.org/0000-0002-7581-1583 $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1389393
245 1 0 $a Locating Eigenvalues in Graphs $h [electronic resource] : $b Algorithms and Applications / $c by Carlos Hoppen, David P. Jacobs, Vilmar Trevisan.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XII, 136 p. 37 illus., 25 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 Algebras, Linear. $3 528115
650 0 $a Graph theory. $3 527884
650 0 $a Algorithms. $3 527865
650 0 $a Discrete mathematics. $3 1254302
650 1 4 $a Linear Algebra. $3 1207620
650 2 4 $a Graph Theory. $3 786670
650 2 4 $a Applications of Discrete Mathematics. $3 1389140
700 1 $a Jacobs, David P. $e author. $1 https://orcid.org/0000-0001-9409-0761 $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1389394
700 1 $a Trevisan, Vilmar. $e author. $1 https://orcid.org/0000-0002-7053-8530 $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1389395
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031116971
776 0 8 $i Printed edition: $z 9783031116995
830 0 $a SpringerBriefs in Mathematics, $x 2191-8198 $3 1255329
856 4 0 $u https://doi.org/10.1007/978-3-031-11698-8
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)