A New Property of Hamming Graphs and Mesh of d-ary Trees-Reference-Cited by-同舟云学术

A New Property of Hamming Graphs and Mesh of d-ary Trees

Published:2008 Issue: Volume: Page:139-150
ISSN:0302-9743
Container-title:Computer Mathematics
language:
Short-container-title:

Author:

Bretto Alain,Jaulin Cerasela,Gillibert Luc,Laget Bernard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-87827-8_11

Reference16 articles.

1. Babai, L.: Handbook of combinatorics. In: Automorphism groups, isomorphism, reconstruction, ch. 27 (1994)

2. Bretto, A., Faisant, A.: Another way for associating a graph to a group. Math.Slovaca 55(1), 1–8 (2005)

3. Bretto, A., Gilibert, L., Laget, B.: Symmetric and Semisymmetric Graphs Construction Using G-graphs. In: Kauers, M. (ed.) International Symposium on Symbolic and Algebraic Computation (ISSAC 2005), Beijing, China, July 24-27, 2005, pp. 61–67. ACM press, New York (2005) ISBN:1-59593-095-7

4. Bretto, A., Gilibert, L.: G-graphs for the cage problem: a new upper bound. In: International Symposium on Symbolic and Algebraic Computation (ISSAC 2007), Waterloo, Ontario, Canada, July-29 August-1st 2007. ACM press, New York (2007) ISBN:978-1-59593-743-8

5. Bretto, A., Faisant, A., Gillibert, L.: G-graphs: A new representation of groups. Journal of Symbolic Computation 42(5), 549–560 (2007)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Incidence Graphs of Bipartite G-Graphs;Optimization Theory, Decision Making, and Operations Research Applications;2012-09-19

2. Cayley graphs and G-graphs: Some applications;Journal of Symbolic Computation;2011-12