Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
نویسندگان
چکیده
In this paper, we extend known relationships between Cayley (di)graphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomorphism 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 networks via mapping and pruning. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honeycomb meshes, including the derivation of provably correct shortest-path routing algorithms for such networks. Index terms – Cayley digraphs, Cellular networks, Coset graphs, Diameter, Distributed systems, Homomorphism, Interconnection networks, Internode distance, Parallel processing, Routing. List of key notation Unless explicitly specified, all graphs in this paper are undirected graphs. • ≤ • Subgroup relationship •< • Normal subgroup relationship •/• Set of (right) cosets • × • Graph or set cross-product • The symbol “•” repeated i times (•,•) Edge 〈•〉 Cyclic group → Mapping ↔ Bijection ≅ Isomorphic to ≡ Congruent to Γ, Δ, Σ Graphs or digraphs φ Homomorphism 1 Identity element of a group Aut( ) Automorphism group Ck Cycle (ring network) of size k Cay( ) Cayley graph CCCq Cube-connected cycles of order q Cos( ) Coset graph dis( ) Distance function E( ) Edge set of a graph G, H Groups K, N Subgroups sign(e) −1 if e < 0; 0 if e = 0; +1 if e > 0 S, T Generator sets, subsets of G V( ) Vertex set of a graph Zq Cyclic group of order q Z Elem. abelian d-group of order d d q _______________________________ 1 Research supported by the Natural Science Foundation of China and Guangdong Province. 2 Department of Computer Science, South China University of Technology, Guangzhou 510641, China. E-mail: [email protected] 3 Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA. E-mail: [email protected]
منابع مشابه
Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks
In this short communication, we extend the known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomorphism 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 exist...
متن کاملStructural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
Despite numerous interconnection schemes proposed for distributed multicomputing, systematic studies of classes of interprocessor networks, that offer speed-cost tradeoffs over a wide range, have been few and far in between. A notable exception is the study of Cayley graphs that model a wide array of symmetric networks of theoretical and practical interest. Properties established for all, or fo...
متن کاملHexagonal and Pruned Torus Networks as Cayley Graphs
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess other interesting mathematical properties. In this paper, we use Cayley-graph formulations for the aforementioned networks, along with some of our previous results on subgraphs and coset graphs, to draw conclusions relatin...
متن کاملCayley graph associated to a semihypergroup
The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as Hamiltonian cycles in this graph. Also, by some of examples we will illustrate the properties and behavior of these Cayley graphs, in particulars we show that ...
متن کاملNotes on The Connectivity of Cayley Coset Digraphs
Hamidoune’s connectivity results [11] for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used in [11]. They are used to show that cycle-prefix g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2007