Advertisement

Incidence Graphs of Bipartite G-Graphs

  • Cerasela TanasescuEmail author
  • Ruxandra Marinescu-Ghemeci
  • Alain Bretto
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 31)

Abstract

Defining graphs from groups is a widely studied area motivated, for example, by communication networks. The most popular graphs defined by a group are Cayley graphs. G-graphs correspond to an alternative construction. After recalling the main properties of these graphs and their motivation, we propose a characterization result. With the help of this result, we show that the incidence graph of a symmetric bipartite G-graph is also a G-graph and we give a proof that, with some constraints, if the incidence graph of a symmetric bipartite graph is G-graph, the graph is also a G-graph. Using these results, we give an alternative proof for the fact that mesh of d-ary trees are G-graphs.

Keywords

Bipartite Graph Cyclic Group Undirected Graph Cayley Graph Simple Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Barth, D.: Bandwidth and cutwidth of the mesh of d-Ary trees. Euro-Par I, 243–246 (1996)Google Scholar
  2. 2.
    Bretto, A., Faisant, A.: Another way for associating a graph to a group. Math. Slovaca 55(1), 1–8 (2005)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Bretto, A., Gilibert, L.: Symmetric and semisymmetric graphs construction using G-graphs. In: Kauers, M. (ed.) International Symposium on Symbolic and Algebraic Computation, (ISSAC’05), pp. 61–67, Beijing, China, 24–27 July. ACM, New York. ISBN:1-59593-095-7 (2005)Google Scholar
  4. 4.
    Bretto, A., Gilibert, L.: G-graphs for the cage problem: a new upper bound. In: International Symposium on Symbolic and Algebraic Computation, (ISSAC’07), Waterloo, Ontario, Canada, 29 July–1 August. ACM, New York. ISBN:978-1-59593-743-8 (2007)Google Scholar
  5. 5.
    Bretto, A., Faisant, A., Gillibert, L.: G-graphs: A new representation of groups. J. Symbolic Comput. 42(5), 549–560 (2007). ISSN:0747-7171Google Scholar
  6. 6.
    Bretto, A., Jaulin, C., Gillibert, L., Laget, B.: Hamming graphs and mesh of d-ary trees are G-graphs. In: Asian Symposium in Computer Mathematics, 15–18 December 2007, Singapore. LNCS, vol. 5081, pp. 139–150. Springer, Berlin (2008)Google Scholar
  7. 7.
    Lu, J., Moura, J.M.: Structured LDPC codes for high-density recording: large girth and low error floor. IEEE Trans. Magn. 42, 208–213 (2006)CrossRefGoogle Scholar
  8. 8.
    Robinson, D.J.S.: A course in the theory of groups. Graduate Texts in Mathematics, Springer, Berlin, 80 (1982)Google Scholar
  9. 9.
    Zhong-fu, Z., Bing, Y., Jing-wen, L., Lin-zhong, L., Jian-fang, W., Bao-gen, X.: On Incidence Graphs. Ars Combinatoria 87, 213–223 (2008)zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Cerasela Tanasescu
    • 1
    Email author
  • Ruxandra Marinescu-Ghemeci
    • 2
  • Alain Bretto
    • 3
  1. 1.ESSEC Business SchoolParisFrance
  2. 2.University of BucharestBucharestRomania
  3. 3.GREYC CNRS UMR-6072Université de CaenCaen cedexFrance

Personalised recommendations