Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph

Neng Pin Lu*

*此作品的通信作者

研究成果: 期刊稿件文章同行評審

4 引文 斯高帕斯(Scopus)

指紋

深入研究「Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph」主題。共同形成了獨特的指紋。

Computer Science

Mathematics