RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
- 1 December 2011
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 22 (08) , 1939-1948
Abstract
In the last few years a new definition for closeness has been established because of the ability to measure not connected graphs and the possibility to create convenient formulas for calculations. Based on this definition a new, more sensitive measure for network vulnerability is created - residual closeness. The residual closeness utilizes closeness received after the removal of a link or a vertex and its links. In this article some formulas for easy calculation of residual closeness are given. The definition for closeness is generalized and its properties are explored.Keywords
This publication has 6 references indexed in Scilit:
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKSInternational Journal of Foundations of Computer Science, 2011
- Residual closeness in networksPhysica A: Statistical Mechanics and its Applications, 2006
- On a class of posets and the corresponding comparability graphsJournal of Combinatorial Theory, Series B, 1978
- Centrality in social networks conceptual clarificationSocial Networks, 1978
- The binding number of a graph and its Anderson numberJournal of Combinatorial Theory, Series B, 1973
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973