{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:04Z","timestamp":1725663484825},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510826"},{"type":"electronic","value":"9783540461500"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51082-6_89","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:38:52Z","timestamp":1330184332000},"page":"334-340","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the (d,D,D,s)-digraph problem"],"prefix":"10.1007","author":[{"given":"P.","family":"Morillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Fiol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Guitart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"25_CR1","unstructured":"G. Chartrand & L. Lesniak, Graphs & Digraphs, Wadsworth, Monterey, 1986."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"J.C. Bermond, J.Bond, M.Paoli & C.Peyrat, Graphs and Interconnection Networks: Diameter and Vulnerability, Surveys in Combinatorics, London Math. Soc. Lec. Not. Ser.82, pp 1\u201330, Cambridge University Press, 1983.","DOI":"10.1017\/CBO9781107325548.002"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"M.A.Fiol, I.Alegre & J.L.A.Yebra, Line digraphs iterations and the (d,k) problem for directed graphs, IEEE Proc. 10th International Symposium on Computer Architecture, pp 174\u2013177, Stockholm, 1983.","DOI":"10.1145\/1067651.801653"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0095-8956(80)90091-X","volume":"29","author":"W.G. Bridges","year":"1980","unstructured":"W.G. Bridges & S. Toueg, On the impossibility of directed Moore graphs, J. Comb. Theory B, 29, pp 339\u2013341, 1980.","journal-title":"J. Comb. Theory B"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1090\/S0002-9939-1965-0191841-6","volume":"16","author":"A.J. Hoffman","year":"1965","unstructured":"A.J. Hoffman & M.H. McAndrew, The polynomial of a directed graph, Proc. Amer. Math. Soc., vol.16, pp 303\u2013309, 1965.","journal-title":"Proc. Amer. Math. Soc."},{"key":"25_CR6","volume-title":"Complex Variables","author":"N. Levinson","year":"1975","unstructured":"N. Levinson & R.M. Redheffer, Complex Variables, Holden-Day Inc., San Francisco, 1975."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51082-6_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:37:13Z","timestamp":1558255033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51082-6_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510826","9783540461500"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-51082-6_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}