Fault-free longest paths in star networks with conditional link faults

Tsai, Ping-Ying; Fu, Jung-Sheng; Chen, Gen-Huey

doi:10.1016/j.tcs.2008.11.012

Cited by 23 publications

(8 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For more faulty edges, Fu [55] showed that S n is (2n − 7)-edge-faulttolerant hamiltonian if every vertex is incident with at least two fault-free edges for n 4. Tsai, Fu and Chen [144] have obtained a stronger result. Recently, Hsieh and Wu [82] improved the result of Fu [55] by increasing faulty edges from 2n − 7 to 3n − 10.…”

Section: Star Graphsmentioning

confidence: 97%

Survey on path and cycle embedding in some networks

2009

Front. Math. China

View full text Add to dashboard Cite

To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding problem. To find cycles of all lengths from its girth to its order in a graph is the pancyclic problem. A stronger concept than the pancylicity is the panconnectivity. A graph of order n is said to be panconnected if for any pair of different vertices x and y with distance d there exist xy-paths of every length from d to n. The pancyclicity or the panconnectivity is an important property to determine if the topology of a network is suitable for some applications where mapping cycles or paths of any length into the topology of the network is required. The pancyclicity and the panconnectivity of interconnection networks have attracted much research interest in recent years. A large amount of related work appeared in the literature, with some repetitions. The purpose of this paper is to give a survey of the results related to these topics for the hypercube and some hypercube-like networks.

show abstract

Section: Star Graphsmentioning

confidence: 97%

Survey on path and cycle embedding in some networks

2009

Front. Math. China

View full text Add to dashboard Cite

show abstract

“…Hamiltonian, Hamiltonian connected, panconnected) for F # EðGÞ; jFj 6 k. The fault-tolerant pancyclicity has been investigated widely. There is a substantial amount of related literature [7][8][9][10][11][12]15,16,[19][20][21][22]25].…”

Section: Introductionmentioning

confidence: 99%

Edge-fault-tolerant pancyclicity of arrangement graphs

Sun

Wang

2014

Information Sciences

View full text Add to dashboard Cite

“…Within a complex network, each node represents a unit (or element) with certain dynamical characteristics and edge represents the relationship or connection between two units (or elements). Examples of complex networks corresponding to different network topologies are small-world networks [4], scale-free networks [5], star networks [6] and ring networks [7]. Bipartite networks are an important kind of complex networks, whose nodes can be divided into two disjoint nonempty sets such that every edge only connects a pair of nodes which belong to different sets.…”

Section: Introductionmentioning

confidence: 99%