QQ客服 官方微博 反馈留言

	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
卷号	58页码:51-60
关键词	Centrality method Spanning tree Weighted network Matrix tree theorem Kirchhoff polynomial
DOI	10.1016/j.patrec.2015.02.007
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4791631
专题	山东大学
作者单位	1.Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China. 2.W Virginia Univ, Dept M
推荐引用方式 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,58: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,58,51-60.
MLA	Qi, Xingqin,et al."A novel centrality method for weighted networks based on the Kirchhoff polynomial".PATTERN RECOGNITION LETTERS 58(2015):51-60.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。