Residual Closeness of Generalized Thorn Graphs

Article type: Research Article

Authors: Dangalchev, Chavdar^{; *}

Affiliations: Pactera Technologies Redmond, WA, USA, [email protected]

Correspondence: [*] Address for correspondence: 12613 SE 42nd ST, Bellevue, Wa 98006, USA.

Abstract: One of the most sensitive characteristics of network vulnerability is residual closeness. Calculating the closeness and the residual closeness of larger graphs is a time consuming and operations heavy process. In this article, we try to mitigate the process for thorn graphs - we present the thorn graphs residual closeness as a function of the closeness and the residual closeness of the original graphs.

Keywords: network vulnerability, closeness, residual closeness, thorn graph

DOI: 10.3233/FI-2018-1710

Journal: Fundamenta Informaticae, vol. 162, no. 1, pp. 1-15, 2018