A study of odd graphs as fault-tolerant interconnection networks

DOI10.1109/12.73594zbMath1373.68134OpenAlexW2113232823MaRDI QIDQ4592945

Arif Ghafoor, Theodore R. Bashkow

Publication date: 9 November 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.73594

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 (5)

Wiener index of generalized odd complete graphs ⋮ The vulnerability of the diameter of folded \(n\)-cubes ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ The covering radius of doubled 2-designs in \(2O_ k\) ⋮ Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs

This page was built for publication: A study of odd graphs as fault-tolerant interconnection networks