-
Views
-
Cite
Cite
Yanna Wang, Bo Zhou, Residual Closeness, Matching Number and Chromatic Number, The Computer Journal, Volume 66, Issue 5, May 2023, Pages 1156–1166, https://doi.org/10.1093/comjnl/bxac004
- Share Icon Share
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.
© The British Computer Society 2022. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com
This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model)
Issue Section:
Section A: Computer Science Theory, Methods and Tools
You do not currently have access to this article.