DOI: 10.5176/2251-1911_CMCGS43
Authors: Cerasela Tanasescu and Ruxandra Marinescu-Ghemeci
Abstract: Network are modelized by graphs. Studying network robustness is studying graph connectivity. In this frame, the graphs constructed from groups play an important role, as they have strong regular properties. Among them, the most famous are Cayley graphs. G-graphs seems to be an interesting candidate for constructing symmetric and semisymmetric networks. In this paper we are interested to possible applications of G-graphs in interconnecting networks. Therefore we remind some properties of G-graphs and study their connectivity.
Keywords: G-graphs, connectivity, vertex-transitivity, edgetransitivity, optimally connected, network, robustness
Updating...