Author:
Costa S.I.R.,Strapasson J.E.,Alves M.M.S.,Carlos T.B.
Subject
Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory
Reference21 articles.
1. On planarity and colorability of circulant graphs;Heuberger;Discrete Math.,2003
2. F.P. Muga II, Undirected circulant graphs, in: International Symposium on Parallel Architectures, Algorithms and Networks, 1994, pp. 113–118.
3. The degree-diameter problem for several varieties of Cayley graphs. I: The Abelian Case;Dougherty;SIAM J. Discrete Math.,2004
4. C. Martínez, R. Beivide, J. Gutierrez, E. Gabidulin, On the perfect t-dominating set problem in circulant graphs and codes over Gaussian integers, in: Proceedings ISIT – IEEE International Symposium on Information Theory, 2005, pp. 1–5.
5. Circulant graph imbeddings;Parkson;J. Combin. Theory (B),1980