Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs

DOI10.1016/j.ipl.2009.07.004zbMath1209.68374OpenAlexW2049393987MaRDI QIDQ990947

Zhao Zhang, Yanmei Hong

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.004

zbMATH Keywords

fault tolerancemaximally connectedsuper-connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Vulnerability of super extra edge-connected graphs ⋮ Realizability of fault-tolerant graphs

Cites Work

• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• Extraconnectivity of graphs with large girth
• On the extraconnectivity of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs