Residual Closeness in Cycles and Related Networks

DOI10.3233/FI-2013-835zbMath1311.68017OpenAlexW1635237076MaRDI QIDQ2841952

Z. N. Odabaş, Aysun Aytaç

Publication date: 30 July 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-835

zbMATH Keywords

stabilitycyclescommunication networknetwork design and communicationclosenessgraph vulnerability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (15)

The vulnerability of some networks including cycles via domination parameters ⋮ 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 ⋮ Node and link vulnerability in complete multipartite networks ⋮ Closeness and vertex residual closeness of Harary graphs ⋮ Vertex and link residual closeness of graphs of given fractional matching number ⋮ Additional Closeness and Networks Growth

This page was built for publication: Residual Closeness in Cycles and Related Networks