{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:36:23Z","timestamp":1725528983165},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540244011"},{"type":"electronic","value":"9783540305408"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30540-8_9","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T06:36:43Z","timestamp":1294987003000},"page":"87-93","source":"Crossref","is-referenced-by-count":1,"title":["Some Conditions for the Existence of (d,k)-Digraphs"],"prefix":"10.1007","author":[{"given":"Yus Mochamad","family":"Cholily","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edy Tri","family":"Baskoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saladin","family":"Uttunggadewa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"43","volume":"56","author":"E.T. Baskoro","year":"2000","unstructured":"Baskoro, E.T., Miller, M., Plesn\u00edk, J.: Further results on almost Moore digraph. Ars Combinatoria\u00a056, 43\u201363 (2000)","journal-title":"Ars Combinatoria"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s003730050019","volume":"14","author":"E.T. Baskoro","year":"1998","unstructured":"Baskoro, E.T., Miller, M., Plesn\u00edk, J.: On the structure of digraphs with order close to the Moore bound. Graphs and Combinatorics\u00a014, 109\u2013119 (1998)","journal-title":"Graphs and Combinatorics"},{"key":"9_CR3","unstructured":"Baskoro, E.T., Miller, M., \u0160ir\u00e1\u0148, J., dan Sutton, M.: Complete characterization of almost Moore digraphs of degree three. Journal of Graph Theory (in press)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","volume":"3","author":"J.C. Bermond","year":"1986","unstructured":"Bermond, J.C., Delorme, C., Quisquater, J.J.: Strategies for interconnection networks: Some methods from graph theory. Journal of Parallel and Distributed Computing\u00a03, 433\u2013449 (1986)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0095-8956(80)90091-X","volume":"29","author":"W.G. Bridges","year":"1980","unstructured":"Bridges, W.G., Toueg, S.: On impossibility of directed Moore graphs. J. Combinatorial Theory Series B\u00a029, 339\u2013341 (1980)","journal-title":"J. Combinatorial Theory Series B"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Fiol, M.A., Alegre, I., Yebra, J.L.A.: Line digraph iteration and the (d,k) problem for directed graphs. In: Proc. 10th Symp. Comp. Architecture, Stockholn, pp. 174\u2013177 (1983)","DOI":"10.1145\/1067651.801653"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1002\/jgt.3190140608","volume":"14","author":"M.A. Fiol","year":"1990","unstructured":"Fiol, M.A., Yebra, J.L.A.: Dense bipartite digraphs. J. Graph Theory\u00a014, 687\u2013700 (1990)","journal-title":"J. Graph Theory"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0012-365X(99)90087-0","volume":"197","author":"J. Gimbert","year":"1999","unstructured":"Gimbert, J.: On the existence of (d,k)-digraphs. Discrete Mathematics\u00a0197\/198, 375\u2013391 (1999)","journal-title":"Discrete Mathematics"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0012-365X(00)00316-2","volume":"231","author":"J. Gimbert","year":"2001","unstructured":"Gimbert, J.: Enumeration of almost Moore digraphs of diameter 2. Discrete Mathematics\u00a0231, 177\u2013190 (2001)","journal-title":"Discrete Mathematics"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1093\/comjnl\/31.1.71","volume":"31","author":"M. Miller","year":"1988","unstructured":"Miller, M., Fris, I.: Minimum diameter of direguler digraphs of degree 2. Computer Journal\u00a031, 71\u201375 (1988)","journal-title":"Computer Journal"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Miller, M., Fris, I.: Maximum order digraphs for diameter 2 or degree 2. In: Pullman Volume of Graphs and Matrices. Lecture Note in Pure and Applied Mathematics, vol.\u00a0139, pp. 269\u2013298 (1992)","DOI":"10.1201\/9780203719916-19"},{"issue":"1-3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0012-365X(99)00357-X","volume":"218","author":"M. Miller","year":"2000","unstructured":"Miller, M., Gimbert, J., \u0160ir\u00e1\u0148, J., Slamin: Almost Moore digraphs are diregular. Discrete Mathematics\u00a0218(1-3), 265\u2013270 (2000)","journal-title":"Discrete Mathematics"},{"key":"9_CR13","unstructured":"Plesn\u00edk, J., Zn\u00e1m, \u0160.: Strongly geodetic directed graphs. Acta F.R.N. Univ. Comen. Mathematica XXIX, 29\u201334 (1974)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Geometry and Graph Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30540-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:16Z","timestamp":1605761956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30540-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244011","9783540305408"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30540-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}