{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:38:21Z","timestamp":1775255901311,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0012-365x(02)00807-5","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"195-201","source":"Crossref","is-referenced-by-count":10,"title":["On strong distances in oriented graphs"],"prefix":"10.1016","volume":"266","author":[{"given":"Peter","family":"Dankelmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henda C.","family":"Swart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Day","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00807-5_BIB1","series-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen","year":"2000"},{"key":"10.1016\/S0012-365X(02)00807-5_BIB2","first-page":"33","article-title":"Strong distance in strong digraphs","volume":"31","author":"Chartrand","year":"1999","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(02)00807-5_BIB3","first-page":"49","article-title":"On strong distance in strong oriented graphs","volume":"138","author":"Chartrand","year":"1999","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(02)00807-5_BIB4","unstructured":"G. Chartrand, L. Lesniak, Graphs and Digraphs, 2nd Edition, Wadsworth and Brooks\/Cole Advanced Books and Software, Monterey, CA, 1986."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T16:23:02Z","timestamp":1553790182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0012365X02008075"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00807-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}