Graphs as models of communication network vulnerability: Connectivity and persistence

DOI10.1002/net.3230110106zbMath0471.05041OpenAlexW2031245498MaRDI QIDQ3924242

F. T. Boesch, Jerald A. Kabell, Frank Harary

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110106

zbMATH Keywords

persistencediametervulnerability

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (16)

Efficient fault-tolerant routings in networks ⋮ Vulnerability in graphs of diameter five ⋮ Some extended results on diameter-stable graphs ⋮ Network reliability: Heading out on the highway ⋮ The Menger number of the Cartesian product of graphs ⋮ Super connectivity of folded twisted crossed cubes ⋮ Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs ⋮ An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms ⋮ A note on vulnerability in graphs of diameter five(II) ⋮ Expected value expansions in rooted graphs ⋮ Counterexamples to theorems of Menger type for the diameter ⋮ CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS ⋮ On the robustness of interconnections in random graphs: a symbolic approach. ⋮ Vulnerability in graphs of diameter four

Cites Work

• Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity

This page was built for publication: Graphs as models of communication network vulnerability: Connectivity and persistence