|
Dyuthi @ CUSAT >
e-SCHOLARSHIP >
Computer Applications >
Faculty >
Dr. Kannan Balakrishnan >
Please use this identifier to cite or link to this item:
http://purl.org/purl/4221
|
| Title: | Betweenness Centrality in Some Classes of Graphs |
| Authors: | Kannan, Balakrishnan
Sunil Kumar, R
Jathavedan, M |
| Keywords: | betweenness centrality measures
perfect matching
dual graph
interval regular
branch of a tree
antipodal vertices
tearing. |
| Issue Date: | 19-Mar-2014 |
| 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. |
| Description: | arXiv preprint arXiv:1403.4701 |
| URI: | http://dyuthi.cusat.ac.in/purl/4221 |
| Appears in Collections: | Dr. Kannan Balakrishnan
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
