@inproceedings{c19738ce35684fc6ba3ece2eba83d1d6,

title = "Embed longest rings onto star graphs with vertex faults",

abstract = "The star graph has been recognized as an attractive alternative to the hypercube. Let Fe and Fν be the sets of vertex faults and edge faults, respectively. Previously, Tseng et al. showed that an n-dimensional star graph can embed a ring of length n! if |Fe|≤n-3 (|Fν|=0), and a ring of length at least n!-4|Fν| if |Fν|≤n-3 (|Fe|=0). Since an n-dimensional star graph is regular of degree n-1 and is bipartite with two partite sets of equal size, our result achieves optimality in the worst case.",

author = "Hsieh, {Sun Yuan} and Chen, {Gen Huey} and Ho, {Chin Wen}",

year = "1998",

month = jan,

day = "1",

doi = "10.1109/ICPP.1998.708473",

language = "English",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "140--147",

editor = "Lai, {Ten H.}",

booktitle = "Proceedings - 1998 International Conference on Parallel Processing, ICPP 1998",

address = "United States",

note = "1998 International Conference on Parallel Processing, ICPP 1998 ; Conference date: 10-08-1998 Through 14-08-1998",

}