A Study of Some Centrality Measures in Graphs

Dyuthi/Manakin Repository

A Study of Some Centrality Measures in Graphs

Show full item record

Title: A Study of Some Centrality Measures in Graphs
Author: Ramkumar; Kannan
Abstract: Centrality is in fact one of the fundamental notions in graph theory which has established its close connection with various other areas like Social networks, Flow networks, Facility location problems etc. Even though a plethora of centrality measures have been introduced from time to time, according to the changing demands, the term is not well defined and we can only give some common qualities that a centrality measure is expected to have. Nodes with high centrality scores are often more likely to be very powerful, indispensable, influential, easy propagators of information, significant in maintaining the cohesion of the group and are easily susceptible to anything that disseminate in the network.
URI: http://dyuthi.cusat.ac.in/purl/5086
Date: 2014-06


Files in this item

Files Size Format View Description
Dyuthi-T2152.pdf.pdf 1.421Mb PDF View/Open PDF

This item appears in the following Collection(s)

Show full item record

Search Dyuthi


Advanced Search

Browse

My Account