In this paper we introduce the concepts of vertex-to-clique distance sum, clique-to-vertex distance sum and clique-to-clique distance sum in a connected graph. Using these concepts we define the corresponding medians and peripheries and investigate the properties of these centrality concepts. Also we characterise a self clique-to-clique median graph in terms of its clique graph.
展开▼
