{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:45:53Z","timestamp":1649213153375},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0166-218x(02)00594-2","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T22:28:16Z","timestamp":1059690496000},"page":"395-416","source":"Crossref","is-referenced-by-count":1,"title":["Diameter vulnerability of GC graphs"],"prefix":"10.1016","volume":"130","author":[{"given":"J.","family":"G\u00f3mez","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":"78","reference":[{"key":"10.1016\/S0166-218X(02)00594-2_BIB1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF01110285","article-title":"On the linegraph of a directed graph","volume":"102","author":"Aigner","year":"1967","journal-title":"Math. Z."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB2","first-page":"1","article-title":"Graphs and interconnection networks","volume":"82","author":"Bermond","year":"1983","journal-title":"London Math. Soc. Lecture Notes Ser."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB3","first-page":"65","article-title":"Grands graphes non dirig\u00e9s de degr\u00e9 et diam\u00e8tre fix\u00e9s","volume":"17","author":"Bermond","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB5","unstructured":"J. Bond, Grands r\u00e9seaux d'interconnexions, Thesis, Universit\u00e9 de Paris-Sud, 1987."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB6","unstructured":"J. Bond, C. Peyrat, Diameter vulnerability in networks, in: Graph Theory with Application to Algorithms and Computer Science (Kalamazoo, Michigan, 1984), Wiley\u2013Interscience, New York, 1985, pp. 123\u2013149."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB7","first-page":"267","article-title":"Diameter vulnerability of some large interconnection networks","volume":"66","author":"Bond","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB8","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":"European J. Combin."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/jgt.3190090304","article-title":"Large bipartite graphs with given degree and diameter","volume":"8","author":"Delorme","year":"1985","journal-title":"J. Graph Theory"},{"issue":"9","key":"10.1016\/S0166-218X(02)00594-2_BIB10","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/TC.1984.1676504","article-title":"Large graphs with given degree and diameter-part I","volume":"33","author":"Delorme","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB11","unstructured":"C. Delorme, J.J. Quisquater, Some new constructions of large graphs, LRI Research Report. Univ. Paris-Sud, Orsay, 1986, p. 317."},{"issue":"2","key":"10.1016\/S0166-218X(02)00594-2_BIB12","first-page":"137","article-title":"Algunos grafos compuestos","volume":"VII","author":"Fiol","year":"1983","journal-title":"Stochastica"},{"issue":"5","key":"10.1016\/S0166-218X(02)00594-2_BIB13","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d,k) problem","volume":"33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB14","unstructured":"J. G\u00f3mez, Diametro y vulnerabilidad en redes de interconexi\u00f3n, Thesis, Universitat Polit\u00e8cnica de Catalunya, 1986."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB15","first-page":"33","article-title":"Generalized compound graphs","volume":"29-B","author":"G\u00f3mez","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB16","first-page":"211","article-title":"Dense compound graphs","volume":"20-A","author":"G\u00f3mez","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(92)90135-W","article-title":"Graphs on alphabets as models for large interconnection networks","volume":"37\/38","author":"G\u00f3mez","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB18","first-page":"174","article-title":"Sur une certaine correspondance entre graphes","volume":"33","author":"Heuchenne","year":"1964","journal-title":"Bull. Soc. Roy. Sci. Li\u00e8ge"},{"key":"10.1016\/S0166-218X(02)00594-2_BIB19","unstructured":"W.H. Kautz, Design of optimal interconnection networks for multiprocessors, Architecture and Design of Digital Computer, NATO Adv. Summer Inst. (1969) 249\u2013272."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB20","doi-asserted-by":"crossref","unstructured":"J.G. Kuhl, S.M. Reddy, Fault-tolerance considerations in large multiprocessor systems, IEEE Comput. (1986) 56\u201367.","DOI":"10.1109\/MC.1986.1663180"},{"key":"10.1016\/S0166-218X(02)00594-2_BIB21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-218X(84)90024-6","article-title":"Diameter vulnerability of graphs","volume":"9","author":"Peyrat","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00594-2_BIB22","unstructured":"S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, Proceedings of the 20th Annual Allerton Conference, 1982, pp. 1018\u20131026."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005942?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005942?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T21:09:30Z","timestamp":1585084170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X02005942"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00594-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}