IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i5d10.1007_s10878-023-01042-5.html
   My bibliography  Save this article

On the residual closeness of graphs with cut vertices

Author

Listed:
  • Chengli Li

    (South China Normal University)

  • Leyou Xu

    (South China Normal University)

  • Bo Zhou

    (South China Normal University)

Abstract

In designing and understanding of computer networks, how to improve network robustness or protect a network from vulnerability remains an overarching concern. The residual closeness is a measure of network vulnerability and robustness even when the removal of vertices does not disconnect the underlying graph. We determine all the graphs that minimize and maximize the residual closeness respectively over all n-vertex connected graphs with r cut vertices, where $$1\le r\le n-3$$ 1 ≤ r ≤ n - 3 .

Suggested Citation

  • Chengli Li & Leyou Xu & Bo Zhou, 2023. "On the residual closeness of graphs with cut vertices," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01042-5
    DOI: 10.1007/s10878-023-01042-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-01042-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-023-01042-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dangalchev, Chavdar, 2006. "Residual closeness in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 365(2), pages 556-564.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fazal Hayat & Daniele Ettore Otera, 2024. "Maximizing Closeness in Bipartite Networks: A Graph-Theoretic Analysis," Mathematics, MDPI, vol. 12(13), pages 1-13, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fazal Hayat & Daniele Ettore Otera, 2024. "Maximizing Closeness in Bipartite Networks: A Graph-Theoretic Analysis," Mathematics, MDPI, vol. 12(13), pages 1-13, June.
    2. Belik, Ivan & Hexmoor, Henry, 2013. "The Multifactor Model of the Agent’s Power in Social Networks," Discussion Papers 2013/11, Norwegian School of Economics, Department of Business and Management Science.
    3. Michael D. König & Xiaodong Liu & Yves Zenou, 2019. "R&D Networks: Theory, Empirics, and Policy Implications," The Review of Economics and Statistics, MIT Press, vol. 101(3), pages 476-491, July.
    4. Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2018. "Group based centrality for immunization of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 35-47.
    5. Yelai Feng & Huaixi Wang & Chao Chang & Hongyi Lu, 2022. "Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths," Mathematics, MDPI, vol. 10(14), pages 1-18, July.
    6. Adrian Alter & Ben R. Craig & Peter Raupach, 2015. "Centrality-Based Capital Allocations," International Journal of Central Banking, International Journal of Central Banking, vol. 11(3), pages 329-377, June.
    7. Salavati, Chiman & Abdollahpouri, Alireza & Manbari, Zhaleh, 2018. "BridgeRank: A novel fast centrality measure based on local structure of the network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 635-653.
    8. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    9. Hu, Jianqiang & Yu, Jie & Cao, Jinde & Ni, Ming & Yu, Wenjie, 2014. "Topological interactive analysis of power system and its communication module: A complex network approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 99-111.
    10. da Cunha, Éverton Fernandes & da Fontoura Costa, Luciano, 2022. "On hypercomplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    11. Guijie Zhang & Luning Liu & Yuqiang Feng & Zhen Shao & Yongli Li, 2014. "Cext-N index: a network node centrality measure for collaborative relationship distribution," Scientometrics, Springer;Akadémiai Kiadó, vol. 101(1), pages 291-307, October.
    12. Mustafa C. Camur & Thomas Sharkey & Chrysafis Vogiatzis, 2022. "The Star Degree Centrality Problem: A Decomposition Approach," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 93-112, January.
    13. Huang, Chuangxia & Zhao, Xian & Deng, Yunke & Yang, Xiaoguang & Yang, Xin, 2022. "Evaluating influential nodes for the Chinese energy stocks based on jump volatility spillover network," International Review of Economics & Finance, Elsevier, vol. 78(C), pages 81-94.
    14. Ebadi, Ashkan & Schiffauerova, Andrea, 2015. "How to become an important player in scientific collaboration networks?," Journal of Informetrics, Elsevier, vol. 9(4), pages 809-825.
    15. Sun, Hong-liang & Chen, Duan-bing & He, Jia-lin & Ch’ng, Eugene, 2019. "A voting approach to uncover multiple influential spreaders on weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 303-312.
    16. Sullivan, James L. & Novak, David C., 2024. "A method for evaluating accessibility in transportation problems considering social vulnerability," European Journal of Operational Research, Elsevier, vol. 317(3), pages 646-659.
    17. Safaei, F. & Yeganloo, H. & Akbar, R., 2020. "Robustness on topology reconfiguration of complex networks: An entropic approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 379-409.
    18. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    19. Zhao, Zi-Juan & Guo, Qiang & Yu, Kai & Liu, Jian-Guo, 2020. "Identifying influential nodes for the networks with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 551(C).
    20. Wang, Xiaojie & Su, Yanyuan & Zhao, Chengli & Yi, Dongyun, 2016. "Effective identification of multiple influential spreaders by DegreePunishment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 238-247.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01042-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.