RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS

DOI10.1142/S0129054111009136zbMath1236.68012OpenAlexW2135708046MaRDI QIDQ3224958

Chavdar Atanasov Dangalchev

Publication date: 13 March 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111009136

zbMATH Keywords

connectivityclosenessgraph vulnerabilityresidual closeness

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Connectivity (05C40)

Related Items (14)

Distance hedonic games ⋮ On decay centrality in graphs ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ The closeness eigenvalues of graphs ⋮ Extremal Results on Vertex and Link Residual Closeness ⋮ Link Residual Closeness of Harary Graphs ⋮ Residual closeness of graphs with given parameters ⋮ Computing closeness for some graphs ⋮ On the residual closeness of graphs with cut vertices ⋮ Additional Closeness of Cycle Graphs ⋮ Network robustness and residual closeness ⋮ Robustness of Regular Caterpillars ⋮ Link Vulnerability in Networks ⋮ Additional Closeness and Networks Growth

Cites Work

• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• The binding number of a graph and its Anderson number

This page was built for publication: RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS