| dc.contributor.author |
Kannan, Balakrishnan |
|
| dc.contributor.author |
Sunil Kumar, R |
|
| dc.contributor.author |
Jathavedan, M |
|
| dc.date.accessioned |
2014-07-22T09:09:46Z |
|
| dc.date.available |
2014-07-22T09:09:46Z |
|
| dc.date.issued |
2014-03-19 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/4221 |
|
| dc.description |
arXiv preprint arXiv:1403.4701 |
en_US |
| dc.description.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. |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.subject |
betweenness centrality measures |
en_US |
| dc.subject |
perfect matching |
en_US |
| dc.subject |
dual graph |
en_US |
| dc.subject |
interval regular |
en_US |
| dc.subject |
branch of a tree |
en_US |
| dc.subject |
antipodal vertices |
en_US |
| dc.subject |
tearing. |
en_US |
| dc.title |
Betweenness Centrality in Some Classes of Graphs |
en_US |
| dc.type |
Article |
en_US |