Fault-tolerant diameter for three family interconnection networks

DOI10.1007/s10878-010-9362-2zbMath1270.90093OpenAlexW2130577900MaRDI QIDQ437063

Tongliang Shi, Mei Lu

Publication date: 17 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9362-2

zbMATH Keywords

diameterinterconnection networksfault-tolerant diameter

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

A diagnosis algorithm by using graph-coloring under the PMC model ⋮ Conditional diagnosability of the round matching composition networks ⋮ The vulnerability of the diameter of the enhanced hypercubes ⋮ The Component (Edge) Connectivity of Round Matching Composition Networks ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model ⋮ Topological properties on the diameters of the integer simplex

Cites Work

• Fault diameter of Cartesian product graphs
• Fault-diameter of Cartesian graph bundles
• Fault diameter of product graphs
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Fault diameter of interconnection networks
• Super-connectivity and super-edge-connectivity for some interconnection networks
• On the diameter vulnerability of Kautz digraphs
• Restricted connectivity for three families of interconnection networks
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks

This page was built for publication: Fault-tolerant diameter for three family interconnection networks