找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 11296|回復(fù): 42
樓主
發(fā)表于 2025-3-21 16:57:56 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Locating Eigenvalues in Graphs
副標(biāo)題Algorithms and Appli
編輯Carlos Hoppen,David P. Jacobs,Vilmar Trevisan
視頻videohttp://file.papertrans.cn/588/587775/587775.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Locating Eigenvalues in Graphs網(wǎng)絡(luò)公開度




書目名稱Locating Eigenvalues in Graphs網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Locating Eigenvalues in Graphs被引頻次




書目名稱Locating Eigenvalues in Graphs被引頻次學(xué)科排名




書目名稱Locating Eigenvalues in Graphs年度引用




書目名稱Locating Eigenvalues in Graphs年度引用學(xué)科排名




書目名稱Locating Eigenvalues in Graphs讀者反饋




書目名稱Locating Eigenvalues in Graphs讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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 .(.),
板凳
發(fā)表于 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
地板
發(fā)表于 2025-3-22 04:39:15 | 只看該作者
5#
發(fā)表于 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
6#
發(fā)表于 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
7#
發(fā)表于 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
8#
發(fā)表于 2025-3-22 23:23:13 | 只看該作者
9#
發(fā)表于 2025-3-23 01:51:05 | 只看該作者
10#
發(fā)表于 2025-3-23 05:56:42 | 只看該作者
Locating Eigenvalues in Graphs978-3-031-11698-8Series ISSN 2191-8198 Series E-ISSN 2191-8201
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 02:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
娄底市| 芷江| 通渭县| 凤山县| 武清区| 沛县| 隆尧县| 凤凰县| 和政县| 东城区| 肃南| 高邮市| 荥经县| 如皋市| 高淳县| 南京市| 四平市| 大同市| 恭城| 申扎县| 灵川县| 望江县| 疏勒县| 汝城县| 峨山| 梅河口市| 股票| 永和县| 南郑县| 舒城县| 永兴县| 清水县| 普陀区| 雷州市| 中超| 香港| 新疆| 延川县| 邯郸县| 马鞍山市| 资中县|