A novel centrality method for weighted networks based on the Kirchhoff polynomial | |
Qi, Xingqin; Fuller, Edgar; Luo, Rong; Zhang, Cun-quan | |
刊名 | Pattern recognition letters
![]() |
2015 | |
页码 | 51-60 |
关键词 | Centrality method Spanning tree Weighted network Matrix tree theorem Kirchhoff polynomial |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4770106 |
专题 | 山东大学 |
作者单位 | 1.Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China 2.W Virginia Univ, Dept Math, Morgantown, WV 26506 USA 3.W Virginia |
推荐引用方式 GB/T 7714 | Qi, Xingqin,Fuller, Edgar,Luo, Rong,et al. A novel centrality method for weighted networks based on the Kirchhoff polynomial[J]. Pattern recognition letters,2015:51-60. |
APA | Qi, Xingqin,Fuller, Edgar,Luo, Rong,&Zhang, Cun-quan.(2015).A novel centrality method for weighted networks based on the Kirchhoff polynomial.Pattern recognition letters,51-60. |
MLA | Qi, Xingqin,et al."A novel centrality method for weighted networks based on the Kirchhoff polynomial".Pattern recognition letters (2015):51-60. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论