4 research outputs found
Classes of Symmetric Cayley Graphs over Finite Abelian Groups of Degrees 4 and 6
The present work is devoted to characterize the family of symmetric
undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.Comment: 12 pages. A previous version of some of the results in this paper
where first announced at 2010 International Workshop on Optimal
Interconnection Networks (IWONT 2010). It is accessible at
http://upcommons.upc.edu/revistes/handle/2099/1037
Symmetric L-graphs
In this paper we characterize symmetric L-graphs, which are either Kronecker products of two cycles or Gaussian graphs.
Vertex symmetric networks have the property that the communication load is uniformly distributed on all the vertices so that
there is no point of congestion. A stronger notion of symmetry, edge symmetry, requires that every edge in the graph looks the
same. Such property ensures that the communication load is uniformly distributed over all the communication links, so that
there is no congestion at any link.Peer Reviewe