Vulnerability of Mycielski graphs via residual closeness.

zbMATH Open1349.05195MaRDI QIDQ2804772FDOQ2804772

Tufan Turaci, Mukaddes Ökten

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Residual closeness of wheels and related networks
• Residual closeness for helm and sunflower graphs
• Residual closeness and generalized closeness
• Link vulnerability in networks
• scientific article; zbMATH DE number 6770087

zbMATH Keywords

connectivitynetwork design and communicationMycielski graphsgraph vulnerabilityresidual closeness

Mathematics Subject Classification ID

Connectivity (05C40) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cited In (14)

• Node and link vulnerability in complete multipartite networks
• Network robustness and residual closeness
• Robustness of Regular Caterpillars
• Computing closeness for some graphs
• Additional Closeness and Networks Growth
• On the residual closeness of graphs with cut vertices
• Closeness and vertex residual closeness of Harary graphs
• The average lower reinforcement number of a graph
• The vulnerability of some networks including cycles via domination parameters
• Computational complexity of network vulnerability analysis
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• Additional Closeness of Cycle Graphs
• Link Residual Closeness of Harary Graphs
• Vulnerability of nearest neighbor graphs

This page was built for publication: Vulnerability of Mycielski graphs via residual closeness.

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