{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T22:12:55Z","timestamp":1655935975538},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3364,"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":[[2004,5]]},"DOI":"10.1016\/s0166-218x(03)00379-2","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T22:28:16Z","timestamp":1059690496000},"page":"255-261","source":"Crossref","is-referenced-by-count":4,"title":["Distances and diameters on iterated clique graphs"],"prefix":"10.1016","volume":"141","author":[{"given":"Miguel A.","family":"Piza\u00f1a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00379-2_BIB1","first-page":"263","article-title":"Self-clique graphs and diameters of iterated clique graphs","volume":"29","author":"Balakrishnan","year":"1986","journal-title":"Utilitas Math."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/jgt.3190130209","article-title":"Locally 4-by-4 grid graphs","volume":"13","author":"Blokhuis","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01793007","article-title":"On clique convergent graphs","volume":"11","author":"Bornstein","year":"1995","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/(SICI)1097-0118(199807)28:3<147::AID-JGT4>3.0.CO;2-K","article-title":"Iterated clique graphs with increasing diameters","volume":"28","author":"Bornstein","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB5","doi-asserted-by":"crossref","unstructured":"A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-regular graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) (Results in Mathematics and Related Areas (3)), Vol. 18, Springer, Berlin, 1989.","DOI":"10.1007\/978-3-642-74341-2_6"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(93)90583-F","article-title":"A new infinite series of regular uniformly geodetic code graphs","volume":"120","author":"Brouwer","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s004930070027","article-title":"The Johnson graphs satisfy a distance extension property","volume":"20","author":"Dabrowski","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB8","doi-asserted-by":"crossref","unstructured":"S.T. Hedetniemi, P.J. Slater, Line Graphs of Triangleless Graphs and Iterated Clique Graphs, Lecture Notes in Mathematics, Vol. 303, Springer, Berlin, 1972, pp. 139\u2013147.","DOI":"10.1007\/BFb0067365"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0095-8956(84)90059-5","article-title":"Clique graphs of time graphs","volume":"37","author":"Hedman","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB10","first-page":"273","article-title":"Diameters of iterated clique graphs","volume":"9","author":"Hedman","year":"1986","journal-title":"Hadronic J."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0012-365X(99)90105-X","article-title":"Clique divergent graphs with unbounded sequence of diameters","volume":"197\/198","author":"Larri\u00f3n","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0012-365X(99)00233-2","article-title":"Locally C6 graphs are clique divergent","volume":"215","author":"Larri\u00f3n","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB13","unstructured":"V. Neumann-Lara, A theory of expansive graphs, preprint."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB14","first-page":"313","article-title":"On clique-divergent graphs","volume":"260","author":"Neumann-Lara","year":"1978","journal-title":"Probl\u00e8mes Combin. Th\u00e9or. Graphes (Colloques internationaux du C.N.R.S., Paris)"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB15","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0095-8956(90)90116-H","article-title":"A characterization of Grassmann and Johnson graphs","volume":"48","author":"Numata","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/jgt.3190100204","article-title":"On iterated clique graphs with increasing diameters","volume":"10","author":"Peyrat","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(02)00502-2","article-title":"The icosahedron is clique divergent","volume":"262","author":"Piza\u00f1a","year":"2003","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00379-2_BIB18","doi-asserted-by":"crossref","unstructured":"J.L. Szwarcfiter, A survey on clique graphs, in: B.A. Reed, C. Linhares-Sales (Eds.), Recent Advances in Algorithms and Combinatorics, Springer, New York, 2003, pp. 109\u2013136.","DOI":"10.1007\/0-387-22444-0_5"},{"key":"10.1016\/S0166-218X(03)00379-2_BIB19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(86)90160-3","article-title":"The Johnson graph J(d,r) is unique if (d,r)\u2260 (2,8)","volume":"58","author":"Terwilliger","year":"1986","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003792?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003792?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:25Z","timestamp":1585084165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X03003792"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00379-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}