scientific article
From MaRDI portal
Publication:3789603
zbMath0646.05042MaRDI QIDQ3789603
Curtiss Barefoot, Roger Entringer, Henda C. Swart
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (81)
Integrity of graph operations ⋮ Edge vulnerability parameters of split graphs ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ Integrity of total transformation graphs ⋮ On the toughness index of planar graphs ⋮ Maximum and minimum toughness of graphs of small genus ⋮ Some operations in hub-integrity of graphs ⋮ Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ Measuring the vulnerability for classes of intersection graphs ⋮ The vulnerability of some networks including cycles via domination parameters ⋮ Stability theorems for graph vulnerability parameters ⋮ Graph operations and neighbor rupture degree ⋮ Two results about the hypercube ⋮ Safe number and integrity of graphs ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ The vertex attack tolerance of complex networks ⋮ Extremal graphs with given order and the rupture degree ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ A note on the integrity of grids ⋮ The average lower reinforcement number of a graph ⋮ On the average lower bondage number of a graph ⋮ Diametral path graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Isolated Rupture in Composite Networks ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Planarization and fragmentability of some classes of graphs ⋮ Computational complexity of network vulnerability analysis ⋮ Wiener index and vulnerability parameters of graphs ⋮ Isolated Rupture in Thorny Networks ⋮ TOTAL DOMINATION INTEGRITY OF WHEEL RELATED GRAPHS ⋮ Extended MSO model checking via small vertex integrity ⋮ Parameterized Complexity of Safe Set ⋮ Models and methods for solving the problem of network vulnerability ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ Domination integrity of splitting graph of path and cycle ⋮ Network robustness and residual closeness ⋮ Unnamed Item ⋮ Toughness and binding number ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ Vulnerability of nearest neighbor graphs ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ Exponential Independence Number of Some Graphs ⋮ On the range of possible integrities of graphs \(G(n, k)\) ⋮ Fault-tolerant maximal local-connectivity on bubble-sort star graphs ⋮ On edge-rupture degree of graphs ⋮ A large class of maximally tough graphs ⋮ Extreme tenacity of graphs with given order and size ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Robustness of Regular Caterpillars ⋮ Link Vulnerability in Networks ⋮ How to Cut a Graph into Many Pieces ⋮ The critical node detection problem in networks: a survey ⋮ A survey of integrity ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Toughness in graphs -- a survey ⋮ A survey of some network reliability analysis and synthesis results ⋮ A polynomial algorithm for computing the weak rupture degree of trees ⋮ Maximally local connectivity and connected components of augmented cubes ⋮ On the computational complexity of vertex integrity and component order connectivity ⋮ On the Domination Integrity ⋮ Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions ⋮ Edge vulnerability parameters of bisplit graphs ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Unnamed Item ⋮ Domination integrity of some graph classes ⋮ Subgraph isomorphism on graph classes that exclude a substructure ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Unnamed Item ⋮ Edge integrity of nearest neighbor graphs and separator theorems ⋮ Unnamed Item ⋮ The Valve Location Problem in Simple Network Topologies ⋮ The integrity of a cubic graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs ⋮ Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs ⋮ Toughness and Delaunay triangulations ⋮ Edge-integrity: A survey ⋮ On the honesty of graph complements ⋮ On the edge-integrity of some graphs and their complements ⋮ Tree-core and tree-coritivity of graphs
This page was built for publication:
