Edge‐tenacious networks
From MaRDI portal
Publication:4698225
DOI10.1002/net.3230250103zbMath0821.90046OpenAlexW2111207019MaRDI QIDQ4698225
Fred S. Roberts, B. L. Piazza, Sam Stueckle
Publication date: 3 October 1995
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230250103
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items (17)
Computing the Scattering Number of Graphs ⋮ On the first-order edge tenacity of a graph ⋮ Neighbor Isolated Tenacity of Graphs ⋮ The scattering number of thorn graphs ⋮ Isolated Rupture in Composite Networks ⋮ Tenacity of a graph with maximum connectivity ⋮ Computational complexity of network vulnerability analysis ⋮ Isolated Rupture in Thorny Networks ⋮ Tenacity of complete graph products and grids ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ On edge-rupture degree of graphs ⋮ Extreme tenacity of graphs with given order and size ⋮ Edge Rupture Degree of Graphs ⋮ Link Vulnerability in Networks ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Some results related to the tenacity and existence of \(k\)-trees ⋮ Unnamed Item
Cites Work
This page was built for publication: Edge‐tenacious networks
