期刊
LINEAR ALGEBRA AND ITS APPLICATIONS
卷 433, 期 3, 页码 637-652出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2010.03.035
关键词
Graphs; Networks; Estrada index; Subgraph centrality; Communicability; Sparse matrices; Quadrature rules; Lanczos algorithm; Decay bounds; Matrix exponential; Resolvent
资金
- National Science Foundation [DMS-0810862]
- University Research Committee of Emory University
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [0810862] Funding Source: National Science Foundation
Bounds for entries of matrix functions based on Gauss-type quadrature rules are applied to adjacency matrices associated with graphs. This technique allows to develop inexpensive and accurate upper and lower bounds for certain quantities (Estrada index, subgraph centrality, communicability) that describe properties of networks. (C) 2010 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
