{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:24:07Z","timestamp":1755221047159,"version":"3.43.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1019135804943","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"135-146","source":"Crossref","is-referenced-by-count":1,"title":["Removing edges from hypercubes to obtain vertex\u2010symmetric networks with small diameter"],"prefix":"10.1007","volume":"13","author":[{"given":"Douglas W.","family":"Bass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"329778_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S.B. Akers","year":"1989","unstructured":"S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers 38(4) (1989) 555\u2013566.","journal-title":"IEEE Transactions on Computers"},{"key":"329778_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(95)00023-K","volume":"63","author":"A. Bouabdallah","year":"1995","unstructured":"A. Bouabdallah, C. Delorme and S. Djelloul, Edge deletion preserving the diameter of the hypercube, Discrete Applied Mathematics 63 (1995) 91\u201395.","journal-title":"Discrete Applied Mathematics"},{"key":"329778_CR3","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.2307\/2318261","volume":"82","author":"H. Dweighter","year":"1975","unstructured":"H. Dweighter, American Mathematics Monthly 82 (1975) 1010.","journal-title":"American Mathematics Monthly"},{"key":"329778_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<119::AID-JGT3>3.0.CO;2-W","volume":"23","author":"P. Erdos","year":"1996","unstructured":"P. Erdos, P. Hamburger, R. Pippert and W. Weakley, Hypercube subgraphs with minimal detours, Journal of Graph Theory 23 (1996) 119\u2013128.","journal-title":"Journal of Graph Theory"},{"key":"329778_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W.H. Gates","year":"1979","unstructured":"W.H. Gates and C.H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Mathematics 27 (1979) 47\u201357.","journal-title":"Discrete Mathematics"},{"key":"329778_CR6","volume-title":"Algorithmic Graph Theory","author":"A. Gibbons","year":"1985","unstructured":"A. Gibbons, Algorithmic Graph Theory (Cambridge Univ. Press, Cambridge, UK, 1985)."},{"key":"329778_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01234384","volume":"37","author":"C.D. Godsil","year":"1981","unstructured":"C.D. Godsil, Connectivity of minimal Cayley graphs, Archiv der Mathematik 37 (1981) 473\u2013476.","journal-title":"Archiv der Mathematik"},{"key":"329778_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0166-218X(92)90137-Y","volume":"37","author":"N. Graham","year":"1992","unstructured":"N. Graham and F. Harary, Changing and unchanging the diameter of a hypercube, Discrete Applied Mathematics 37\/38 (1992) 265\u2013274.","journal-title":"Discrete Applied Mathematics"},{"key":"329778_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"M. Heydari","year":"1997","unstructured":"M. Heydari and I.H. Sudborough, On the diameter of the pancake network, Journal of Algorithms 25 (1997) 67\u201394.","journal-title":"Journal of Algorithms"},{"key":"329778_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-015-8937-6_5","volume-title":"Graph Symmetry","author":"M.-C. Heydemann","year":"1997","unstructured":"M.-C. Heydemann, Cayley graphs and interconnection networks, in: Graph Symmetry, eds. G. Hahn and G. Sabidussi (Kluwer Academic Publishers, Amsterdam, 1997) pp. 167\u2013224."},{"key":"329778_CR11","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, San Mateo, CA, 1992)."},{"key":"329778_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W. Mader","year":"1971","unstructured":"W. Mader, Minimale n-fach kantenzusammenh\u00e4ngende Graphen, Mathematische Annalen 191 (1971) 21\u201328.","journal-title":"Mathematische Annalen"},{"issue":"5","key":"329778_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"F.P. Preparata and J. Vuillemin, The cube connected cycles: A versatile network for parallel computation, Communications of the ACM 24(5) (1981) 300\u2013309.","journal-title":"Communications of the ACM"},{"key":"329778_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","volume":"8","author":"M.E. Watkins","year":"1970","unstructured":"M.E. Watkins, Connectivity of transitive graphs, Journal of Combinatorial Theory 8 (1970) 23\u201329.","journal-title":"Journal of Combinatorial Theory"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019135804943.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019135804943\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019135804943.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:23:40Z","timestamp":1754634220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019135804943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["329778"],"URL":"https:\/\/doi.org\/10.1023\/a:1019135804943","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}