{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:24Z","timestamp":1742912004502,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878261"},{"type":"electronic","value":"9783540878278"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87827-8_11","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T13:53:21Z","timestamp":1221918801000},"page":"139-150","source":"Crossref","is-referenced-by-count":2,"title":["A New Property of Hamming Graphs and Mesh of d-ary Trees"],"prefix":"10.1007","author":[{"given":"Alain","family":"Bretto","sequence":"first","affiliation":[]},{"given":"Cerasela","family":"Jaulin","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Gillibert","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Laget","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Babai, L.: Handbook of combinatorics. In: Automorphism groups, isomorphism, reconstruction, ch.\u00a027 (1994)"},{"issue":"1","key":"11_CR2","first-page":"1","volume":"55","author":"A. Bretto","year":"2005","unstructured":"Bretto, A., Faisant, A.: Another way for associating a graph to a group. Math.Slovaca\u00a055(1), 1\u20138 (2005)","journal-title":"Math.Slovaca"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1073884.1073895","volume-title":"International Symposium on Symbolic and Algebraic Computation (ISSAC 2005)","author":"A. Bretto","year":"2005","unstructured":"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\u201367. ACM press, New York (2005) ISBN:1-59593-095-7"},{"key":"11_CR4","volume-title":"International Symposium on Symbolic and Algebraic Computation (ISSAC 2007)","author":"A. Bretto","year":"2007","unstructured":"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"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.jsc.2006.08.002","volume":"42","author":"A. Bretto","year":"2007","unstructured":"Bretto, A., Faisant, A., Gillibert, L.: G-graphs: A new representation of groups. Journal of Symbolic Computation\u00a042(5), 549\u2013560 (2007)","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0747-7171(02)00133-5","volume":"35","author":"J.J. Cannon","year":"2003","unstructured":"Cannon, J.J., Holt, D.F.: Automorphism group computation and isomorphism testing in finite groups. Journal of Symbolic Computation\u00a035(3), 241\u2013267 (2003)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jalgebra.2006.02.014","volume":"300","author":"J.J. Cannon","year":"2006","unstructured":"Cannon, J.J., Holt, D.F.: Computing conjugacy class representatives in permutation groups. Journal of Algebra\u00a0300(1), 213\u2013222 (2006) MR2228644","journal-title":"Journal of Algebra"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-54195-0_65","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"G. Cooperman","year":"1991","unstructured":"Cooperman, G., Finkelstein, L., Sarawagi, N.: Applications of Cayley Graphs. In: Sakata, S. (ed.) AAECC 1990. LNCS, vol.\u00a0508, pp. 367\u2013378. Springer, Heidelberg (1991)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(92)90127-V","volume":"37\/38","author":"G. Cooperman","year":"1992","unstructured":"Cooperman, G., Finkelstein, L.: New Methods for Using Cayley Graphs in Interconnection Networks. Discrete Applied Mathematics\u00a037\/38, 95\u2013118 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/net.10012","volume":"39","author":"P. Fraigniaud","year":"2002","unstructured":"Fraigniaud, P., Konig, J.-C., Lazard, E.: Oriented hypercubes. Networks\u00a039(2), 98\u2013106 (2002)","journal-title":"Networks"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1145\/1141277.1141510","volume-title":"Proceedings of the ACM symposium on Applied computing Dijon, France 2006 SESSION: Geometric computing and reasoning (GCR)","author":"G.-F. Zhang","year":"2006","unstructured":"Zhang, G.-F., Gao, X.-S.: Spatial geometric constraint solving based on k-connected graph decomposition. In: Proceedings of the ACM symposium on Applied computing Dijon, France 2006 SESSION: Geometric computing and reasoning (GCR), pp. 979\u2013983. ACM Press, New York (2006)"},{"key":"11_CR12","unstructured":"The GAP Team, (06 May 2002), GAP - Reference Manual, Release 4.3, \n                      http:\/\/www.gap-system.org"},{"key":"11_CR13","unstructured":"Lauri, J., Scapellato, R.: Topics in Graphs Automorphisms and Reconstruction, London Mathematical Society Student Texts (2003)"},{"issue":"1-3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0012-365X(02)00615-5","volume":"267","author":"J. Lauri","year":"2003","unstructured":"Lauri, J.: Constructing graphs with several pseudosimilar vertices or edges. Discrete Mathematics\u00a0267(1-3), 197\u2013211 (2003)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/acha.2001.0346","volume":"12","author":"D. Rockmore","year":"2002","unstructured":"Rockmore, D., Hordijk, W., Kostelec, P., Stadler, P.F.: Fast Fourier Transform for Fitness Landscapes. Applied and Computational Harmonic Analysis\u00a012(1), 57\u201376 (2002)","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"18","key":"11_CR16","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.disc.2006.04.012","volume":"306","author":"L. Sunil Chandran","year":"2006","unstructured":"Sunil Chandran, L., Kavitha, T.: The carvingwidth of hypercubes. Discrete Mathematics\u00a0306(18), 2270\u20132274 (2006)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87827-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:11:54Z","timestamp":1715238714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87827-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540878261","9783540878278"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87827-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}