A Study of Some Centrality Measures in Graphs

Dyuthi/Manakin Repository

A Study of Some Centrality Measures in Graphs

Show simple item record

dc.contributor.author Ramkumar
dc.contributor.author Kannan
dc.date.accessioned 2016-08-25T05:12:34Z
dc.date.available 2016-08-25T05:12:34Z
dc.date.issued 2014-06
dc.identifier.uri http://dyuthi.cusat.ac.in/purl/5086
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Cochin University of Science and Technology en_US
dc.subject Self-centered graphs en_US
dc.subject p-median en_US
dc.subject Median of a set en_US
dc.subject Median of a profile en_US
dc.title A Study of Some Centrality Measures in Graphs en_US
dc.type Thesis en_US


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 simple item record

Search Dyuthi


Advanced Search

Browse

My Account