Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs

06/12/2019
by   Huifeng Zhang, et al.
0

The twisted hypercube-like networks(THLNs) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of n-dimensional(n-D) THLNs. Let G_n be an n-D THLN and F be a subset of V(G_n)∪ E(G_n) with |F|≤ n-2. We show that for arbitrary two different correct vertices u and v, there is a faultless path P_uv of every length l with 2^n-1-1≤ l≤ 2^n-f_v-1-α, where α=0 if vertices u and v form a normal vertex-pair and α=1 if vertices u and v form a weak vertex-pair in G_n-F(n≥5).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2021

On d-panconnected tournaments with large semidegrees

We prove the following new results. (a) Let T be a regular tournament ...
research
04/07/2019

The Fault-Tolerant Metric Dimension of Cographs

A vertex set U ⊆ V of an undirected graph G=(V,E) is a resolving set for...
research
04/17/2019

A Brief Note on Single Source Fault Tolerant Reachability

Let G be a directed graph with n vertices and m edges, and let s ∈ V(G) ...
research
08/03/2021

Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set

Consider a vertex-weighted graph G with a source s and a target t. Track...
research
09/13/2020

On Fault Tolerant Feedback Vertex Set

The study of fault-tolerant data structures for various network design p...
research
09/10/2020

Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults

The overwhelming majority of survivable (fault-tolerant) network design ...
research
06/19/2019

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

A digraph D=(V, A) has a good pair at a vertex r if D has a pair of arc-...

Please sign up or login with your details

Forgot password? Click here to reset