Rupture degree of graphs

DOI10.1080/00207160412331336062zbMath1074.05053MaRDI QIDQ5466760

Yin-Kui Li, Sheng Gui Zhang, Xue Liang Li

Publication date: 25 August 2005

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

Full work available at URL: https://doi.org/10.1080/00207160412331336062

zbMATH Keywords

network vulnerability; Nordhaus-Gaddum type result; rupture degree

Mathematics Subject Classification ID

05C40: Connectivity

Related Items

Edge Rupture Degree of Graphs, Link Vulnerability in Networks, Weak-Rupture Degree of Graphs, Neighbor Rupture Degree of Harary Graphs, ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS, A Note on the Link Residual Closeness of Graphs Under Join Operation, Vulnerability parameters of split graphs, On agglomeration-based rupture degree in networks and a heuristic algorithm, Isolated Rupture in Composite Networks, Computational complexity of network vulnerability analysis, Isolated Rupture in Thorny Networks, Graph operations and neighbor rupture degree, Extreme tenacity of graphs with given order and size, Extremal graphs with given order and the rupture degree, On edge-rupture degree of graphs, Graph vulnerability parameters, compression, and quasi-threshold graphs, The scattering number of strictly chordal graphs: linear time determination, A polynomial algorithm for computing the weak rupture degree of trees, Bounds for scattering number and rupture degree of graphs with genus, Tree-core and tree-coritivity of graphs, Vulnerability of nearest neighbor graphs, Binding Number and Wheel Related Graphs, Relationships between rupture degree and other parameters, The rupture degree of trees, COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS

Cites Work

• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Unnamed Item
• Unnamed Item