A study of odd graphs as fault-tolerant interconnection networks

DOI10.1109/12.73594zbMATH Open1373.68134OpenAlexW2113232823MaRDI QIDQ4592945FDOQ4592945

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)

Cited In (6)

• The diameter vulnerability of the generalized Petersen graphGP[tk;k]
• A new family of interconnection networks of odd fixed degrees
• Wiener index of generalized odd complete graphs
• The covering radius of doubled 2-designs in \(2O_ k\)
• The vulnerability of the diameter of folded \(n\)-cubes
• 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

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