RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS

DOI10.1142/S0129054111008660zbMath1226.68069OpenAlexW2100010234MaRDI QIDQ3173947

Z. N. Odabaş, Aysun Aytaç

Publication date: 10 October 2011

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

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

zbMATH Keywords

connectivityfriendship graphclosenessgraph vulnerabilitygear graph

Mathematics Subject Classification ID

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

Related Items (12)

RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS ⋮ 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 ⋮ Exponential Independence Number of Some Graphs ⋮ Robustness of Regular Caterpillars ⋮ Link Vulnerability in Networks ⋮ Additional Closeness and Networks Growth

Cites Work

• Unnamed Item
• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Graph Classes: A Survey
• The binding number of a graph and its Anderson number

This page was built for publication: RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS