Robustness of Regular Caterpillars

DOI10.1142/S0129054117500277zbMath1387.68039OpenAlexW2788852177WikidataQ130209622 ScholiaQ130209622MaRDI QIDQ4639921

Zeynep Nihan Odabaş Berberler, Aysun Aytaç

Publication date: 14 May 2018

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

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

zbMATH Keywords

stabilitycommunication 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 (11)

On the average lower bondage number of graphs under join and corona operations ⋮ Extremal Results on Vertex and Link Residual Closeness ⋮ Link Residual Closeness of Harary Graphs ⋮ Residual closeness of graphs with given parameters ⋮ Computational complexity of network vulnerability analysis ⋮ On the residual closeness of graphs with cut vertices ⋮ Additional Closeness of Cycle Graphs ⋮ Exponential Independence Number of Some Graphs ⋮ Exponential Domination Critical and Stability in Some Graphs ⋮ Additional Closeness and Networks Growth ⋮ Global distribution center number of some graphs and an algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The binding number of a graph and its Anderson number
• Hosoya polynomial of composite graphs

This page was built for publication: Robustness of Regular Caterpillars