{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:36:22Z","timestamp":1777520182307,"version":"3.51.4"},"reference-count":58,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1016\/0743-7315(86)90008-0","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"433-449","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":117,"title":["Strategies for interconnection networks: Some methods from graph theory"],"prefix":"10.1016","volume":"3","author":[{"given":"J.-C.","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Delorme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-J.","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(86)90008-0_BIB1","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/PGEC.1965.264176","article-title":"On the construction of (d, k) graphs","volume":"EC-14","author":"Akers","year":"1965","journal-title":"IEEE Trans. Electron Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/jgt.3190100211","article-title":"Some large graphs with given degree and diameter","volume":"10","author":"Alegre","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0743-7315(86)90008-0_BIB3","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TC.1982.1675886","article-title":"A regular network for multicomputer systems","volume":"C-31","author":"Arden","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0743-7315(86)90008-0_BIB5","series-title":"Surveys in Combinatorias, Invited Papers for the Ninth British Combinatorial Conf.","first-page":"1","article-title":"Graphs and interconnection networks: Diameter and vulnerability","volume":"Vol 82","author":"Bermond","year":"1983"},{"key":"10.1016\/0743-7315(86)90008-0_BIB6","series-title":"Proc. Coll. Int. Parallel Algorithms and Architectures","article-title":"Bus interconnection networks with each station on two buses","author":"Bermond","year":"1986"},{"key":"10.1016\/0743-7315(86)90008-0_BIB7","series-title":"Graph Theory and Combinatorias, Proc. Cambridge Combinatorial Conference","first-page":"19","article-title":"Large hypergraphs of diameter 1","author":"Bermond","year":"1984"},{"key":"10.1016\/0743-7315(86)90008-0_BIB8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(84)90012-1","article-title":"Large graphs with given degree and diameter, II","volume":"36","author":"Bermond","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0743-7315(86)90008-0_BIB9_1","series-title":"Proc. Coll.","article-title":"Large graphs with given degree and diameter, III","author":"Bermond","year":"1981"},{"key":"10.1016\/0743-7315(86)90008-0_BIB9_2","first-page":"23","volume":"13","author":"Bermond","year":"1982","journal-title":"Ann Discrete Math."},{"key":"10.1016\/0743-7315(86)90008-0_BIB10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(82)90076-X","article-title":"Tables of large graphs with given degree and diameter","volume":"15","author":"Bermond","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(86)90008-0_BIB11","first-page":"65","article-title":"Grands graphes de degr\u00e9 et diam\u00e8tre fix\u00e9s","volume":"17","author":"Bermond","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0743-7315(86)90008-0_BIB12","series-title":"Proc. First Japan Conference on Graph Theory and Applications","article-title":"Large fault-tolerant interconnection networks","author":"Bermond","year":"1986"},{"key":"10.1016\/0743-7315(86)90008-0_BIB13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608704","article-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0743-7315(86)90008-0_BIB14","article-title":"Construction de grands graphes d'interconnexions","author":"Bond","year":"1984"},{"key":"10.1016\/0743-7315(86)90008-0_BIB15","unstructured":"Brouwer, A. E., and Wilbrink, H. A. Private communication, Jan. 1982."},{"key":"10.1016\/0743-7315(86)90008-0_BIB16","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946"},{"key":"10.1016\/0743-7315(86)90008-0_BIB17","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TC.1985.1676627","article-title":"Interconnection networks based on a generalization of cube-connected cycles","volume":"C-34","author":"Carlsson","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB18","series-title":"Proc. 3rd International Conference on Combinatorial Mathematics","article-title":"Sparse graphs with small diameters","author":"Chung","year":"1985"},{"key":"10.1016\/0743-7315(86)90008-0_BIB19","first-page":"1","article-title":"Diameter of communication networks","volume":"Vol. 34","author":"Chung","year":"1986"},{"key":"10.1016\/0743-7315(86)90008-0_BIB20","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/TC.1983.1676297","article-title":"Torus and other networks as communication networks with up to some hundred points","volume":"C-32","author":"von Conta","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB21","article-title":"Two notes on large graphs","author":"Delorme","year":"1984"},{"key":"10.1016\/0743-7315(86)90008-0_BIB22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0195-6698(85)80043-3","article-title":"Grands graphes de degr\u00e9 et diam\u00e8tre donn\u00e9s","volume":"6","author":"Delorme","year":"1985","journal-title":"J. Europ\u00e9en Combin."},{"key":"10.1016\/0743-7315(86)90008-0_BIB23","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/jgt.3190090304","article-title":"Large bipartite graphs with given degree and diameter","volume":"9","author":"Delorme","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0743-7315(86)90008-0_BIB24","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/TC.1984.1676504","article-title":"Large graphs with given degree and diameter, I","volume":"C-33","author":"Delorme","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB25","series-title":"New large compound graphs","author":"Delorme","year":"1984"},{"key":"10.1016\/0743-7315(86)90008-0_BIB26","series-title":"Proc. IEEE Third International Conference on Distributed Computing Systems","first-page":"312","article-title":"Large regular interconnection networks","author":"Doty","year":"1982"},{"key":"10.1016\/0743-7315(86)90008-0_BIB27","unstructured":"Doty, K. W. Dense bus connection networks. Proc. IEEE 1983 Int. Conf. on Parallel Processing, pp. 158\u2013160."},{"key":"10.1016\/0743-7315(86)90008-0_BIB28","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/TC.1984.1676461","article-title":"New design for dense processor interconnection networks","volume":"C-33","author":"Doty","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB29","first-page":"133","article-title":"Topological constraints on interconnection-limited logic","volume":"IEEE S-164","author":"Elspas","year":"1964"},{"key":"10.1016\/0743-7315(86)90008-0_BIB30","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/net.3230100109","article-title":"Maximum degree in graphs of diameter 2","volume":"10","author":"Erd\u00f6s","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0743-7315(86)90008-0_BIB31","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/C-M.1981.220290","article-title":"A survey of interconnection networks","volume":"14","author":"Feng","year":"1981","journal-title":"Computer"},{"key":"10.1016\/0743-7315(86)90008-0_BIB32","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TC.1981.1675735","article-title":"The lens interconnection strategy","volume":"C-30","author":"Finkel","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB33","series-title":"Proc. Tenth Int. Symposium Comput. Architecture","first-page":"174","article-title":"Line digraph iterations and the (d, k) problem for directed graphs","author":"Fiol","year":"1983"},{"issue":"2","key":"10.1016\/0743-7315(86)90008-0_BIB34","first-page":"137","article-title":"Algunos grafos compuestas","volume":"7","author":"Fiol","year":"1983","journal-title":"Stochastica"},{"key":"10.1016\/0743-7315(86)90008-0_BIB35","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d, k) digraph problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB36","series-title":"Proc. Ninth British Combinatorial Conf.","first-page":"7","article-title":"Sequence graphs and interconnection networks","volume":"16-A","author":"Fiol","year":"1985"},{"key":"10.1016\/0743-7315(86)90008-0_BIB37","article-title":"Diametro y vulnerabilidad en redes de interconexi\u00f3n","author":"G\u00f3mez","year":"1986"},{"key":"10.1016\/0743-7315(86)90008-0_BIB38","series-title":"Proc. Tenth British Combinatorial Conf","first-page":"211","article-title":"Dense compound graphs","volume":"20-A","author":"G\u00f3mez","year":"1985"},{"key":"10.1016\/0743-7315(86)90008-0_BIB39","unstructured":"G\u00f3mez, J., Fiol, M. A., and Yebra, J. L. A. Graphs on alphabets as models for large computer networks. Submitted for publication."},{"key":"10.1016\/0743-7315(86)90008-0_BIB40","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1147\/rd.45.0497","article-title":"On Moore graphs with diameter 2 and 3","volume":"4","author":"Hoffman","year":"1960","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0743-7315(86)90008-0_BIB41","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on building-block network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB42","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graphs with minimum diameter","volume":"C-32","author":"Imase","year":"1983","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0743-7315(86)90008-0_BIB43","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TC.1984.1676410","article-title":"Families of fixed degree graphs for processor interconnection","volume":"C-33","author":"Jerrum","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB44","series-title":"Theory of Cellular Logic Networks and Machines","first-page":"20","article-title":"Bounds on directed (d, k) graphs","author":"Kautz","year":"1968"},{"key":"10.1016\/0743-7315(86)90008-0_BIB45","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0020-0190(81)90107-1","article-title":"High density graphs for processor interconnection","volume":"12","author":"Leland","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(86)90008-0_BIB46","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TC.1982.1676084","article-title":"Some new results about the (d, k) graph problem","volume":"C-31","author":"Memmi","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB47","unstructured":"Peterson, G. L., and Ting, Y. -H. Trade-offs in VLSI for bus communication networks. In 1982\u20131983 Computer Science and Computer Engineering Research Review. University of Rochester, Rochester, N. Y., pp. 23\u201332."},{"key":"10.1016\/0743-7315(86)90008-0_BIB48","unstructured":"Quisquater, J. -J. New constructions of large graphs with fixed degree and diameter. To appear."},{"key":"10.1016\/0743-7315(86)90008-0_BIB49","first-page":"131","article-title":"de Bruijn sequences. A model example of the interaction of discrete mathematics on the computer science","volume":"55","author":"Ralston","year":"1982","journal-title":"Math. Mag."},{"key":"10.1016\/0743-7315(86)90008-0_BIB50","series-title":"Proc. 20th Annual Allerton Conference","first-page":"1018","article-title":"On digraphs with minimum diameter and maximum connectivity","author":"Reddy","year":"1982"},{"key":"10.1016\/0743-7315(86)90008-0_BIB51","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1109\/T-C.1970.222861","article-title":"Improved construction techniques for (d, k) graphs","volume":"C-19","author":"Storwick","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB52","article-title":"Compounding denser (d, k) graph architectures for computer networks.","author":"Uhr","year":"1981"},{"key":"10.1016\/0743-7315(86)90008-0_BIB53","series-title":"Algorithm-Structured Computer Arrays and networks","author":"Uhr","year":"1984"},{"key":"10.1016\/0743-7315(86)90008-0_BIB54","series-title":"Graphs with given diameter and a coloring problem","author":"Wegner","year":"1976"},{"key":"10.1016\/0743-7315(86)90008-0_BIB55","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TC.1981.1675774","article-title":"Communication structures for large networks of microcomputers","volume":"C-30","author":"Wittie","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB56","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/TC.1980.1675518","article-title":"MICROS, a distributed operating system for MICRONET, a reconfigurable network computer","volume":"C-29","author":"Wittie","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(86)90008-0_BIB57","series-title":"Tutorial: Interconnection Networks for Parallel and Distributed Processing","author":"Wu","year":"1984"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731586900080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731586900080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:29Z","timestamp":1757514569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731586900080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["0743731586900080"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(86)90008-0","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1986,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strategies for interconnection networks: Some methods from graph theory","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(86)90008-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}