Robustness of regular caterpillars

DOI10.1142/S0129054117500277MaRDI QIDQ4639921zbMATH OpenOpenAlexWikidataFDO

Authors 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

closenesscommunication networkgraph vulnerabilitynetwork design and communicationstability

Mathematics Subject Classification ID

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

Recommendations

• Extremal Results on Vertex and Link Residual Closeness
• Network robustness and residual closeness
• Residual closeness of wheels and related networks
• Residual closeness of generalized thorn graphs
• Residual closeness in cycles and related networks

Cites work

• Hosoya polynomial of composite graphs
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 1890132 (Why is no real title available?)
• scientific article; zbMATH DE number 1890151 (Why is no real title available?)
• On a class of posets and the corresponding comparability graphs
• Residual closeness and generalized closeness
• Residual closeness in cycles and related networks
• Residual closeness of wheels and related networks
• The binding number of a graph and its Anderson number
• Tough graphs and Hamiltonian circuits.
• Vulnerability of Mycielski graphs via residual closeness.

Cited in

(18)

• scientific article; zbMATH DE number 5927583 (Why is no real title available?)
• scientific article; zbMATH DE number 5844281 (Why is no real title available?)
• Robustness of regular ring lattices based on natural connectivity
• Additional closeness and networks growth
• Exponential Domination Critical and Stability in Some Graphs
• Global distribution center number of some graphs and an algorithm
• Exponential independence number of some graphs
• 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
• 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
• Determining vulnerability of central networks using closeness and Nordhaus-Gaddum type relation

This page was built for publication: Robustness of regular caterpillars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639921)