Can I read Longest Fault-free Paths in Star Graphs with Vertex Faults on EtoBox?

Longest Fault-free Paths in Star Graphs with Vertex Faults by Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho is a Computer Science article available to read on EtoBox.

What is Longest Fault-free Paths in Star Graphs with Vertex Faults about?

The star graph Sn has been recognized as an attractive alternative to the hypercube. Since S1; S2, and S3 have trivial structures, we focus our attention on Sn with n¿4 in this paper. Let Fv denote the set of faulty vertices in Sn. We show that when |Fv|6n -5; Sn with n¿6 contains a fault-free path of length n! -2|Fv| -2 (n! -2|Fv| -1) between arbitrary two vertices of even (odd) distance. Since Sn is bipartite with two partite sets of equal size, the path is longest for the worst-case scenario. The situation of n¿4 and |Fv| ¿ n -5 is also discussed.

Who reads Longest Fault-free Paths in Star Graphs with Vertex Faults?

Author

Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)

Published

2001

Language

EN

Field

Computer Science (Physical Sciences)