{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:33:20Z","timestamp":1775122400390,"version":"3.50.1"},"reference-count":23,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5844,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1002\/(sici)1097-0037(199909)34:2<154::aid-net8>3.0.co;2-7","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T19:39:36Z","timestamp":1100461176000},"page":"154-161","source":"Crossref","is-referenced-by-count":5,"title":["New large graphs with given degree and diameter six"],"prefix":"10.1002","volume":"34","author":[{"given":"J.","family":"G\ufffdmez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Pelayo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Balbuena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB1","first-page":"161","volume-title":"An heuristic improvement algorithm for the (?, D)-graph problem","author":"Allwright","year":"1990","unstructured":"?An heuristic improvement algorithm for the (?, D)-graph problem,? Transputer\/Occam Japan 3, May 1990, and (Editors), Los Press, 1990, pp. 161-179."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(92)90123-R","volume":"37","author":"Bar-Yehuda","year":"1992","journal-title":"Discr Appl Math"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB3","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.4153\/CJM-1966-109-8","volume":"18","author":"Benson","year":"1966","journal-title":"Can J Math"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB4","first-page":"23","volume":"13","author":"Bermond","year":"1982","journal-title":"Ann Discr Math"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(84)90012-1","volume":"36","author":"Bermond","year":"1984","journal-title":"J Comb Theory B"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","volume":"3","author":"Bermond","year":"1986","journal-title":"J Parallel Distrib Comp"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic graph theory","author":"Biggs","year":"1974","unstructured":"Algebraic graph theory, Cambridge University Press, Cambridge, 1974."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0166-218X(92)90125-T","volume":"37","author":"Campbell","year":"1992","journal-title":"Discr Appl Math"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/12.123397","volume":"41","author":"Campbell","year":"1992","journal-title":"IEEE Trans Comput"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB10","author":"Comellas","year":"1995","unstructured":"and ?New large graphs with given degree and diameter,? Graph theory, combinatorics, and applications: Proc Seventh Quadrennial International Conference on the Theory Applications of Graphs, Vol. 1, 1995, pp. 221-233."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0195-6698(85)80043-3","volume":"6","author":"Delorme","year":"1985","journal-title":"Eur J Combin"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(92)90130-3","volume":"38","author":"Delorme","year":"1992","journal-title":"Discr Appl Math 37\/"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB13","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/TC.1984.1676504","volume":"33","author":"Delorme","year":"1984","journal-title":"IEEE Trans Comput c-"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB14","author":"Dinneen","year":"1991","unstructured":"Algebraic methods for efficient network constructions, Master Thesis, Department of Computer Science, University of Victoria, Victoria, B.C., Canada, 1991."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB15","first-page":"211","author":"G\u00f3mez","year":"1985","journal-title":"Ars Combin 20-A"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(93)90368-4","volume":"114","author":"G\u00f3mez","year":"1993","journal-title":"Discr Math"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB17","volume-title":"New large graphs with given degree and diameter six","author":"G\u00f3mez","year":"1998","unstructured":"and New large graphs with given degree and diameter six, Report of investigation, U.P.C., Barcelona, 1998."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB18","series-title":"Mathematical","volume-title":"Eigenvalue techniques in design and graph theory","volume":"121","author":"Haemers","year":"1980","unstructured":"Eigenvalue techniques in design and graph theory, Mathematical Centre Tracts 121, Mathematisch Zentrum, Amsterdam, 1980."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB19","volume-title":"Projective geometries over finite fields","author":"Hirschfeld","year":"1979","unstructured":"Projective geometries over finite fields, Oxford University Press, Oxford, 1979."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB20","author":"Quisquater","year":"1987","unstructured":"Structures d'interconnexion: Constructions et applications, Th\u00e8se d'etat, LRI, Universit\u00e9 de Paris Sud, Orsay, July 1987."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB21","author":"Samples","year":"1996","unstructured":"and ?Massive parallel architectures for parallel discrete event simulation,? Proc 8th European Simulation Symp (ESS'96), Vol. 2, 1996, pp. 374-378."},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB22","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/TC.1983.1676297","volume":"32","author":"von Conta","year":"1983","journal-title":"IEEE Trans Comput c-"},{"key":"10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7-BIB23","unstructured":"The (?, D) Problem for graphs, http:\/\/www-mat.upc.es.\/grup_de_grafs\/table_g.html."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(199909)34:2%3C154::AID-NET8%3E3.0.CO;2-7","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(199909)34:2%3C154::AID-NET8%3E3.0.CO;2-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:31:06Z","timestamp":1625135466000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,9]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(199909)34:2<154::aid-net8>3.0.co;2-7","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}