已为您找到该学者20条结果 成果回收站
【期刊论文】Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks★
肖文俊, Wenjun Xiao and Behrooz Parhami
TAMC 2006, LNCS 3959, pp. 192-197, 2006,-0001,():
-1年11月30日
In this short communicattion, we extend the known relation-ships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomor-phism and distance between them. Intuitively, Our results correspond to synthesizing alternative, more economical, interconnection networks by reducing the number of dimensions and/or link density of existing net-works via mapping and pruning. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honey comb meshes.
-
28浏览
-
0点赞
-
0收藏
-
0分享
-
49下载
-
0
-
引用
肖文俊, Bao-xing CHEN†, Xie-bin CHEN, Ji-xiang MENG & Wen-jun XIAO
Science in China Series A: Mathematics Jul., 2007, Vol. 50, No.7, 1055-1064,-0001,():
-1年11月30日
The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted reat attention. A related and longtime unsolved problem is: for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained: (1) for any k 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k, e, c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k 0, an infinite family of singular k-tight optimal DLN can be constructed.
double loop network,, diameter,, k-tight optimal,, singular k-tight optimal
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
49下载
-
0
-
引用
【期刊论文】Some results on diameters of Cayley graphs☆
肖文俊, Wenjun Xiao
Discrete Applied Mathematics 154 (2006) 1640 -1644,-0001,():
-1年11月30日
In this note we obtain a simple expression of any finote group by means of its generating set. Applying this result we partly solve a conjecture of Cayley graphs proposed by Babai and Seress. We also obtain some other conclusions on diameters on Cayley graphs.
Finite group, Cayley graph, Diameter
-
24浏览
-
0点赞
-
0收藏
-
0分享
-
30下载
-
0
-
引用
肖文俊
厦门大学学报(自然科学版),1997,36(2):197-199,-0001,():
-1年11月30日
得到有限可解群及其某些子群的阶与其Fitting 子群的阶之间的若干关系。
可解群,, Fitting 子群,, 中心化子
-
21浏览
-
0点赞
-
0收藏
-
0分享
-
32下载
-
0
-
引用
【期刊论文】Some new optimal and suboptimal infinite families of undirected double-loop networks
肖文俊, Bao-Xing Chen, †, Ji-Xiang Meng and Wen-Jun Xiao
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8, 2006, 299-312,-0001,():
-1年11月30日
Let n, s be positive integers such that 2 s<n and s 6= n 2. An undirected double-loop network G(n; 1, s) is an undirected graph (V,E), where V=Zn={0, 1, 2,..., n−1} and E={(i, i+1 (mod n)), (i, i+s (modn)) | i 2 Z}. It is a circulant graph with n nodes and degree 4. In this paper, the sufficient and necessary conditions for a class of undirected double-loop networks to be optimal are presented. By these conditions, 6 new optimal and 5 new suboptimal infinite families of undirected double-loop networks are given.
undirected double-loop networks,, diameter,, optimal,, suboptimal
-
24浏览
-
0点赞
-
0收藏
-
0分享
-
39下载
-
0
-
引用