Routing in Unidirectional (n, k)-star graphs
نویسنده
چکیده
The class of (n, k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of unidirectional (n, k)-star graphs. The previous bound was 10k−5 for small k and 5k+5b(n−1)/2c for large k; the new bound is 7(k−3)+18. In addition, a distributing routing algorithm is presented, analyzed theoretically for worst-case behaviour and exercised experimentally for average case behaviour.
منابع مشابه
The spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملLinearly many faults in Cayley graphs generated by transposition trees
In the design of parallel computing, the first step is to decide how processors are linked. A static interconnection network has point-to-point communication links among the processors. For example, they can be used for message-passing architectures. The n-cubes were the first major class of interconnection networks. However, they have some deficiencies and [1] provided the class of star graphs...
متن کامل$k$-Total difference cordial graphs
Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...
متن کاملStrong structural properties of unidirectional star graphs
Day and Tripathi [K. Day, A. Tripathi, Unidirectional star graphs, Inform. Process. Lett. 45 (1993) 123–129] proposed an assignment of directions on the star graphs and derived attractive properties for the resulting directed graphs: an important one is that they are strongly connected. In [E. Cheng, M.J. Lipman, On the Day–Tripathi orientation of the star graphs: Connectivity, Inform. Process....
متن کاملOrienting Cayley graphs generated by transposition trees
Day and Tripathi [K. Day, A. Tripathi, Unidirectional star graphs, Inform. Process. Lett. 45 (1993) 123–129] proposed an assignment of directions on the star graphs and derived attractive properties for the resulting directed graphs. Cheng and Lipman [E. Cheng, M.J. Lipman, On the Day–Tripathi orientation of the star graphs: Connectivity, Inform. Process. Lett. 73 (2000) 5–10; E. Cheng, M.J. Li...
متن کامل