A new family of Cayley graph interconnection networks of constant degree four

1996 ◽  
Vol 7 (1) ◽  
pp. 26-32 ◽  
Author(s):  
P. Vadapalli ◽  
P.K. Srimani
2019 ◽  
Author(s):  
Caroline Patrão ◽  
Luis Kowada ◽  
Diane Castonguay ◽  
André Ribeiro ◽  
Celina Figueiredo

The family of graphs H,p has been defined in the context of edge partitions. The established properties such as vertex transitivity and low diameter suggest this family as a good topology for the design of interconnection networks. The vertices of the graphH p are the tuples with values between 0 and p1, such that the sum of the values is a multiple of p, and there is an edge between two vertices, if the two corresponding tuples have two pairs of entries whose values differ by one unit. In order to work towards the diameter, the difference between an upper and a lower bounds is established to be at most and we present subfamilies of graphs H p such that, for several values of and p, the bounds are tight.


2001 ◽  
Vol 02 (04) ◽  
pp. 421-444
Author(s):  
AARON HARWOOD ◽  
HONG SHEN

We extensively discuss a new interconnection network topology, denoted by ϒ(n,r). Firstly, the ϒ(n,2) network is shown to provide average cost 3 log 2 n while providing superior fault tolerance characteristics. It is defined over any natural number of nodes n using 2n-3 edges for an average degree of 4 and has diameter no greater than k=⌈ log 2n⌉ with average diameter as small as [Formula: see text]. The network is planar and has cyclomatic number n-2. For n=2t the unbounded maximum degree is 2 log 2 n-1 believed indicative of generally a maximum unbounded degree O( log 2n). The bisection width ranges from 3 when n=2t to t+1 when n=2t+1. Secondly, we provide the ϒ*(n,r) network of bounded degree 2r. For n=rt the ϒ*(n,r) network has asymptotically better average cost than the general deBruijn(r,t) network while also maintaining planarity and cyclomatic property of ϒ(n,2). The ϒ family exhibits unique extremal properties of both theoretical interest and practical importance.


2008 ◽  
Vol 85 (2) ◽  
pp. 269-282 ◽  
Author(s):  
ALISON THOMSON ◽  
SANMING ZHOU

AbstractA first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that S=aH for some a∈K with 〈aH〉=K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as models for interconnection networks, it is thus highly desirable to characterize those which are Frobenius of the first kind. In this paper we first give such a characterization for connected 4-valent circulant graphs, and then describe optimal routing and gossiping schemes for those which are first kind Frobenius graphs. Examples of such graphs include the 4-valent circulant graph with a given diameter and maximum possible order.


Sign in / Sign up

Export Citation Format

Share Document