Centers in Connected Undirected Graphs: An Axiomatic Approach

Herman Monsuur () and Ton Storcken ()
Additional contact information
Herman Monsuur: Royal Netherlands Naval College, Department of International Security Studies, P.O. Box 10.000, 1780 CA Den Helder, The Netherlands
Ton Storcken: University of Maastricht, Department of Quantitative Methods, P.O. Box 616, 6200 MD Maastricht, The Netherlands

Operations Research, 2004, vol. 52, issue 1, 54-64

Abstract: A center is a function that associates with every finite connected and undirected graph a nonempty subset of its vertices. These functions play an important role in networks such as social or interorganizational networks. Centers capture notions like: being a focal point of communication, being strategically located, ability and willingness to participate in strategic alliances, and the like. We focus on the conceptual issue of what makes a position in a graph a central one and investigate some possible concepts of centrality in relation to various properties. Characterizations of the uncovered center, the median, and degree center are presented, where each of these centers is defined for arbitrary connected undirected simple, and possibly cyclic, graphs.

Keywords: Networks/graphs: centrality; social networks; axiomatic approach (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1030.0082 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:52:y:2004:i:1:p:54-64

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().