Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
783 15 |
Ultima descărcare din IBN: 2024-02-01 15:33 |
Căutarea după subiecte similare conform CZU |
519.17 (68) |
Комбинаторный анализ. Теория графов (115) |
SM ISO690:2012 AYTAC, Vecdi, TURACI, Tufan. Closeness centrality in some splitting networks. In: Computer Science Journal of Moldova, 2018, nr. 3(78), pp. 251-269. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 3(78) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.17 | ||||||
Pag. 251-269 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
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. |
||||||
Cuvinte-cheie Graph theory, network design and communication, Complex networks, closeness centrality, splitting graphs. |
||||||
|