Conditional fault-tolerant routing of (n,k)-star graphs

DOI10.1080/00207160.2015.1071798zbMath1401.68021OpenAlexW2267225074MaRDI QIDQ2957750

Yonghong Xiang, Yali Lv, Jianxi Fan

Publication date: 27 January 2017

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

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

zbMATH Keywords

interconnection network\((n,k)\)-star graphfault-tolerant routingconditional fault

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

A complete classification of which \((n,k)\)-star graphs are Cayley graphs

Cites Work

• Node-to-set disjoint paths problem in star graphs
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
• Conditional fault diameter of crossed cubes
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Distance formula and shortest paths for the \((n,k)\)-star graphs
• Node-to-node cluster fault tolerant routing in star graphs
• The \((n,k)\)-star graph: A generalized star graph
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
• The number of shortest paths in the (n, k)-star graph
• Cluster fault-tolerant routing in star graphs
• TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS

This page was built for publication: Conditional fault-tolerant routing of (n,k)-star graphs