找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Locating Eigenvalues in Graphs; Algorithms and Appli Carlos Hoppen,David P. Jacobs,Vilmar Trevisan Book 2022 The Editor(s) (if applicable)

[复制链接]
查看: 11228|回复: 42
发表于 2025-3-21 16:57:56 | 显示全部楼层 |阅读模式
书目名称Locating Eigenvalues in Graphs
副标题Algorithms and Appli
编辑Carlos Hoppen,David P. Jacobs,Vilmar Trevisan
视频video
概述Offers a careful exposition of a class of important eigenvalue location algorithms for various graph classes.Introduces spectral graph theory and graph representations concisely.Describes applications
丛书名称SpringerBriefs in Mathematics
图书封面Titlebook: Locating Eigenvalues in Graphs; Algorithms and Appli Carlos Hoppen,David P. Jacobs,Vilmar Trevisan Book 2022 The Editor(s) (if applicable)
描述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 longstandi
出版日期Book 2022
关键词spectrum; linear-time algorithm; graph; adjacency matrix; Laplacian matrix; tree; spectral graph theory; ei
版次1
doihttps://doi.org/10.1007/978-3-031-11698-8
isbn_softcover978-3-031-11697-1
isbn_ebook978-3-031-11698-8Series ISSN 2191-8198 Series E-ISSN 2191-8201
issn_series 2191-8198
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Locating Eigenvalues in Graphs影响因子(影响力)




书目名称Locating Eigenvalues in Graphs影响因子(影响力)学科排名




书目名称Locating Eigenvalues in Graphs网络公开度




书目名称Locating Eigenvalues in Graphs网络公开度学科排名




书目名称Locating Eigenvalues in Graphs被引频次




书目名称Locating Eigenvalues in Graphs被引频次学科排名




书目名称Locating Eigenvalues in Graphs年度引用




书目名称Locating Eigenvalues in Graphs年度引用学科排名




书目名称Locating Eigenvalues in Graphs读者反馈




书目名称Locating Eigenvalues in Graphs读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:26:33 | 显示全部楼层
Preliminaries,d this theorem as well as the algorithms that follow. We first review some basic ideas of graph theory and linear algebra. The necessary background on eigenvalues and eigenvectors is given, and we define what we mean by an .. In this book, the eigenvalues usually come from the adjacency matrix .(.),
发表于 2025-3-22 03:21:05 | 显示全部楼层
Locating Eigenvalues in Trees,llowed. For a rooted tree ., it can compute in linear time the number of eigenvalues that lie in any interval. It is simple enough to allow calculations by hand on small trees. A unique feature is that the algorithm operates bottom-up on a rooted tree, performing a diagonalization while storing diag
发表于 2025-3-22 04:39:15 | 显示全部楼层
发表于 2025-3-22 11:51:14 | 显示全部楼层
Locating Eigenvalues in Cographs,t will be presented in Chap. ., the clique-width algorithm. Our focus is on the adjacency matrix of cographs. As in the case of trees, the algorithm operates in linear time with respect to the number of vertices. It operates on the cotree of the cograph. As applications, we give a formula for the in
发表于 2025-3-22 15:24:45 | 显示全部楼层
Distance-Hereditary Graphs,e trees. Trees and cographs are distance-hereditary. Like other graph classes discussed in earlier chapters, there exists a linear time diagonalization algorithm. When . is distance-hereditary, .(.) ≤ 2. However, there exist graphs with .(.) = 2 that are not distance-hereditary. Many results in this
发表于 2025-3-22 18:21:26 | 显示全部楼层
Carlos Hoppen,David P. Jacobs,Vilmar TrevisanOffers a careful exposition of a class of important eigenvalue location algorithms for various graph classes.Introduces spectral graph theory and graph representations concisely.Describes applications
发表于 2025-3-22 23:23:13 | 显示全部楼层
发表于 2025-3-23 01:51:05 | 显示全部楼层
发表于 2025-3-23 05:56:42 | 显示全部楼层
Locating Eigenvalues in Graphs978-3-031-11698-8Series ISSN 2191-8198 Series E-ISSN 2191-8201
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 19:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表