Betweenness centrality of honeycomb networks

被引：0

作者：

Rajasingh, Indra ^{[1
]}

Rajan, Bharati ^{[1
]}

Florence, Isido D. ^{[1
]}

机构：

[1] Department of Mathematics, Loyola College, Chennai 600 034, India

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2011年 / 79卷

关键词：

Honeycomb structures - MESH networking - Complex networks - Graph theory - Interconnection networks (circuit switching);

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. Betweenness centrality of a vertex is defined as the fraction of shortest paths that pass through that vertex. over that between all pairs of vertices It measures the control a vertex has over communication in the network, and can be used to identify key vertices in the network. High centrality indices indicate that a vertex can reach other vertices on relatively short paths, or that a vertex lies on a considerable fraction of shortest paths connecting pairs of other vertices. In this paper we find betweenness centrality of honeycomb mesh which has important applications in mobile networks.

引用

页码：163 / 172