scientific article; zbMATH DE number 861347

From MaRDI portal
Publication:4871072

zbMath0845.05088MaRDI QIDQ4871072

Margaret B. Cozzens, Dara Moazzami, Sam Stueckle

Publication date: 21 May 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (34)

Computing the Scattering Number of GraphsOn the first-order edge tenacity of a graphThe scattering number of strictly chordal graphs: linear time determinationA note on ``Tenacity of a graph with maximum connectivityUnnamed ItemNeighbor Isolated Tenacity of GraphsThe vertex attack tolerance of complex networksRobustness of random graphs based on graph spectraExtremal graphs with given order and the rupture degreeOn agglomeration-based rupture degree in networks and a heuristic algorithmSpectral bounds for the vulnerability parameters of graphsTenacity of a graph with maximum connectivityComputational complexity of network vulnerability analysisISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTSNetwork robustness and residual closenessTenacity of complete graph products and gridsA Note on the Link Residual Closeness of Graphs Under Join OperationVulnerability of nearest neighbor graphsThe rupture degree of treesStability measures of some static interconnection networksOn edge-rupture degree of graphsExtreme tenacity of graphs with given order and sizeGraph vulnerability parameters, compression, and quasi-threshold graphsLink Vulnerability in NetworksVertex vulnerability parameters of Kronecker products of complete graphsBounds for different spreads of line and total graphsOn the neighbour-integrity of sequential joined graphsEdge‐tenacious networksSome results related to the tenacity and existence of \(k\)-treesUnnamed ItemUnnamed Item\(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphsRelationships between rupture degree and other parametersTree-core and tree-coritivity of graphs




This page was built for publication: