Vulnerability of Mycielski graphs via residual closeness.

MaRDI QIDQ2804772zbMATH OpenFDO

Authors Mukaddes Ökten, Tufan Turaci

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

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)

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

Cited in

(17)

• Vulnerability of nearest neighbor graphs
• Link Residual Closeness of Harary Graphs
• Node and link vulnerability in complete multipartite networks
• Network robustness and residual closeness
• Computing closeness for some graphs
• On the residual closeness of graphs with cut vertices
• Closeness and vertex residual closeness of Harary graphs
• Residual closeness of wheels and related networks
• Some network topological notions of the Mycielskian of a graph
• The average lower reinforcement number of a graph
• The vulnerability of some networks including cycles via domination parameters
• Robustness of regular caterpillars
• Computational complexity of network vulnerability analysis
• Additional closeness and networks growth
• Residual closeness for helm and sunflower graphs
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• Additional Closeness of Cycle 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)