Finding a fault tolerant routing on neighbour-faulty hypercube

DOI10.1080/00207160410001715302zbMath1082.68590OpenAlexW2063583978MaRDI QIDQ4823343

Elgin Kiliç, Pinar Dundar

Publication date: 27 October 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160410001715302

zbMATH Keywords

connectivitycube algebra

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

Cites Work

• A survey of integrity
• The neighbour-integrity of boolean graphs and its compounds
• On the neighbour-integrity of sequential joined graphs

This page was built for publication: Finding a fault tolerant routing on neighbour-faulty hypercube