Graphs as models of communication network vulnerability: Connectivity and persistence

DOI10.1002/NET.3230110106MaRDI QIDQ3924242zbMATH OpenOpenAlexFDO

Authors 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

diameterpersistencevulnerability

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924242)