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.
CitationCamarero, Cristóbal; Martínez, Carmen; Beivide Palacio, Julio Ramón. Symmetric L-graphs. A: International Workshop on Optimal Networks Topologies. "Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010". Barcelona: Iniciativa Digital Politècnica, 2011, p. 169-181.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org