Closeness centrality in some splitting networks.

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2018 Moldova (Republic of), Turkey Publisher:Academy of Sciences of Moldova, Institute of Mathematics and Computer Science (IMCS), ChişinăuJournal:Comput. Sci. J. Moldova, volume 26, pages 251-269

Authors: Aytac, Vecdi; Turaci, Tufan;

handle: 11454/31052

Closeness centrality in some splitting networks.

- Summary
- Subjects
- Metrics

Abstract

A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks, and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. We consider closeness centrality which is defined as the total graph-theoretic distance to all other vertices in the graph. In this paper, closeness centrality of some splitting graphs is calculated, and exact values are obtained.

WOS: 000449530100003

Countries

Moldova (Republic of), Turkey

Related Organizations

Ege University
Turkey
Information Society Development Institute
Moldova (Republic of)

Keywords

Graph theory, closeness centrality, Electronic computers. Computer science, Graph theory (including graph drawing) in computer science, graph theory, Complex networks, QA75.5-76.95, complex networks, Small world graphs, complex networks (graph-theoretic aspects), splitting graphs., splitting graphs, network design and communication

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Green

gold