Residual Closeness, Matching Number and Chromatic Number
Authors:
- 12 February 2022
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (5) , 1156-1166
Abstract
Residual closeness is a novel graph-based network vulnerability parameter. In this model, links are perfectly reliable and the nodes fail independently of each other. We characterize those graphs with maximum residual closeness and those connected graphs with minimum residual closeness when matching number (chromatic number, respectively) is fixed.Keywords
This publication has 18 references indexed in Scilit:
- Bounds on the radius and status of graphsNetworks, 2014
- RESIDUAL CLOSENESS AND GENERALIZED CLOSENESSInternational Journal of Foundations of Computer Science, 2011
- Proximity and remoteness in graphs: Results and conjecturesNetworks, 2011
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKSInternational Journal of Foundations of Computer Science, 2011
- Multiscale vulnerability of complex networksChaos: An Interdisciplinary Journal of Nonlinear Science, 2007
- Attack vulnerability of complex networksPhysical Review E, 2002
- Scattering number and extremal non-hamiltonian graphsDiscrete Mathematics, 1988
- The binding number of a graph and its Anderson numberJournal of Combinatorial Theory, Series B, 1973
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- Analysis and Design of Survivable NetworksIEEE Transactions on Communications, 1970