Betweenness Centrality in Some Classes of Graphs
Sunil Kumar R (Research Scholar, Department of Computer Applications,, Cochin University of Science, Technology), Kannan Balakrishnan (Associate, Professor, Department of Computer Applications, Cochin University of Science, and Technology), M. Jathavedan (Professor Emeritus
TL;DR
This paper analyzes betweenness centrality in specific classes of graphs, providing insights into how certain graph structures influence the importance of vertices in information flow.
Contribution
It offers a detailed study of betweenness centrality for important classes of graphs, expanding understanding of centrality measures in network analysis.
Findings
Betweenness centrality formulas for specific graph classes
Insights into vertex influence in network flow
Comparison of centrality measures across graph types
Abstract
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Distributed systems and fault tolerance · Advanced Graph Theory Research