On the residual closeness of graphs with cut vertices

DOI10.1007/S10878-023-01042-5zbMath1527.05054OpenAlexW4381280569MaRDI QIDQ6168181

No author found.

Publication date: 10 July 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01042-5

zbMATH Keywords

cut verticesnetwork vulnerabilitydistances in graphsresidual closeness

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Residual Closeness in Cycles and Related Networks
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
• Multiscale vulnerability of complex networks
• Network robustness and residual closeness
• Robustness of Regular Caterpillars
• Residual Closeness of Generalized Thorn Graphs
• Extremal Results on Vertex and Link Residual Closeness
• Residual closeness of graphs with given parameters

This page was built for publication: On the residual closeness of graphs with cut vertices