A study of odd graphs as fault-tolerant interconnection networks

DOI10.1109/12.73594MaRDI QIDQ4592945zbMATH OpenOpenAlexFDO

Authors 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)

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

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