| dc.creator | Costa S.I.R. | |
| dc.creator | Strapasson J.E. | |
| dc.creator | Alves M.M.S. | |
| dc.creator | Carlos T.B. | |
| dc.date | 2011 | |
| dc.date | 2015-06-30T20:19:34Z | |
| dc.date | 2015-11-26T14:48:12Z | |
| dc.date | 2015-06-30T20:19:34Z | |
| dc.date | 2015-11-26T14:48:12Z | |
| dc.date.accessioned | 2018-03-28T21:58:55Z | |
| dc.date.available | 2018-03-28T21:58:55Z | |
| dc.identifier | | |
| dc.identifier | Linear Algebra And Its Applications. , v. 434, n. 8, p. 1811 - 1823, 2011. | |
| dc.identifier | 243795 | |
| dc.identifier | 10.1016/j.laa.2009.08.019 | |
| dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-79951671664&partnerID=40&md5=859ac2bb73e627ac9a4b06506d2eb873 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/107577 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/107577 | |
| dc.identifier | 2-s2.0-79951671664 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1253537 | |
| dc.description | Circulant graphs are characterized here as quotient lattices, which are realized as vertices connected by a knot on a k-dimensional flat torus tessellated by hypercubes or hyperparallelotopes. Via this approach we present geometric interpretations for a bound on the diameter of a circulant graph, derive new bounds for the genus of a class of circulant graphs and establish connections with spherical codes and perfect codes in Lee spaces. © 2010 Elsevier Inc. All rights reserved. | |
| dc.description | 434 | |
| dc.description | 8 | |
| dc.description | 1811 | |
| dc.description | 1823 | |
| dc.description | Heuberger, C., On planarity and colorability of circulant graphs (2003) Discrete Math., 268, pp. 153-169 | |
| dc.description | Muga II, F.P., Undirected circulant graphs (1994) International Symposium on Parallel Architectures, Algorithms and Networks, pp. 113-118 | |
| dc.description | Dougherty, R., Faber, V., The degree-diameter problem for several varieties of Cayley graphs. I: The Abelian Case (2004) SIAM J. Discrete Math., 17 (3), pp. 478-519 | |
| dc.description | C. Martínez, On the perfect t-dominating set problem in circulant graphs and codes over Gaussian integers (2005) Proceedings ISIT - IEEE International Symposium on Information Theory, pp. 1-5 | |
| dc.description | Parkson, T.D., Circulant graph imbeddings (1980) J. Combin. Theory (B), 29, pp. 310-320 | |
| dc.description | Golomb, S.W., Welch, L.R., Algebraic coding and the Lee metric (1968) Proc. Sympos. Math. Res. Center, pp. 175-194. , Madison, Wis., John Wiley, New York | |
| dc.description | Horak, P., On perfect Lee codes (2008) Discrete Mathematics, , doi:10.1016/j.disc.2008.03.019 | |
| dc.description | Ádám, A., Research problem 2-10 (1967) J. Combin. Theory, 2, p. 393 | |
| dc.description | Elspas, B., Turner, J., Graphs with circulant adjacency matrices (1970) J. Combin. Theory, 9, pp. 229-240 | |
| dc.description | Liskovets, V., Pöschel, R., Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (2000) Discrete Math., 214, pp. 173-191 | |
| dc.description | Muzychuk, M., Ádám's conjecture is true in the square-free case (1995) J. Combin. Theory A, 72 (1), pp. 118-134 | |
| dc.description | Boesch, F., Tindell, R., Circulants and their connectivities (1984) J. Graph Theory, 8, pp. 487-499 | |
| dc.description | Stillwell, J., (1992) Geometry of Surfaces, , Springer-Verlag New York | |
| dc.description | Costa, S.I.R., Muniz, M., Agustini, E., Palazzo, R., Graphs, tessellations, and perfect codes on flat tori (2004) IEEE Trans. Inform. Theory, 50 (10), pp. 2363-2378 | |
| dc.description | Conway, J.H., Sloane, N.J.A., (1999) Sphere Packings, Lattices and Groups, , Springer-Verlag New York | |
| dc.description | Costa, S.I.R., Strapasson, J.E., Muniz, M., Siqueira, R.M., Circulant graphs, lattices and spherical codes (2007) Internat. J. Appl. Math., 20 (5), pp. 581-594 | |
| dc.description | Kirschenhofer, P., Pethõ, A., Tichy, R., On analytical and Diophantine properties of a family of counting functions (1999) Acta Sci. Math. (Szeged), 65 (12), pp. 47-59 | |
| dc.description | Albdaiwi, B.F., Bose, B., Quasi-perfect Lee distance codes (2003) IEEE Trans. Inform. Theory, 49, pp. 1535-1539 | |
| dc.description | Gross, J.L., Tucker, T.W., (2001) Topological Graph Theory, , Dover NY | |
| dc.description | Trudeau, R.J., (1976) Introduction to Graph Theory, , Dover New York | |
| dc.description | Molitierno, J.J., On the algebraic connectivity of graphs as a function of genus (2006) Linear Algebra and Its Applications, 419 (2-3), pp. 519-531. , DOI 10.1016/j.laa.2006.05.014, PII S0024379506002667 | |
| dc.language | en | |
| dc.publisher | | |
| dc.relation | Linear Algebra and Its Applications | |
| dc.rights | fechado | |
| dc.source | Scopus | |
| dc.title | Circulant Graphs And Tessellations On Flat Tori | |
| dc.type | Artículos de revistas | |
