{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:31Z","timestamp":1759063531941},"reference-count":21,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":3992,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1995,11]]},"abstract":"Abstract<\/jats:title>It is known tht Moore<\/jats:italic> digraphs of degree d<\/jats:italic> > 1 and diameter k<\/jats:italic> > 1 do not exist (see [20] or [5]). Furthermore, for degree 2, it is shown tht for l<\/jats:italic> \u2265 3 there are no digraphs of order \u201cclose\u201d to, i.e., one less than Moore<\/jats:italic> bound [18]. In this paper, we shall consider digraphs of diameter k<\/jats:italic>, degree 3 and number of vertices one less than Moore<\/jats:italic> bound. We give a necessary condition for the existence of such digraphs and, using this condition, we deduce that such digraphs do not exist for infinitely many values of the diameter. \u00a9 1995 John Wiley & Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190200310","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T15:27:08Z","timestamp":1181230028000},"page":"339-349","source":"Crossref","is-referenced-by-count":10,"title":["Digraphs of degree 3 and order close to the moore bound"],"prefix":"10.1002","volume":"20","author":[{"given":"Edy Tri","family":"Baskoro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1n","family":"Plesn\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0160tefan","family":"Zn\u00e1m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"191","article-title":"On finite Moore graphs","volume":"20","author":"Bannai E.","year":"1973","journal-title":"J. Fac. Sci. Univ. Tokyo, Sect. 1\u2010A"},{"key":"e_1_2_1_3_2","first-page":"739","article-title":"On the construction of networks with minimum diameter","volume":"15","author":"Baskoro E. T.","year":"1993","journal-title":"Australi. Comput. Sci. Commun."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(86)90008-0"},{"key":"e_1_2_1_5_2","first-page":"189","article-title":"Directed graphs and matrix equations","volume":"28","author":"Bos\u00e1k J.","year":"1978","journal-title":"Math. Slovaca"},{"key":"e_1_2_1_6_2","first-page":"39","article-title":"On the impossibility of directed Moore graphs","volume":"29","author":"Bridges W. G.","year":"1980","journal-title":"J. Combinatorical Theory Series B"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100048015"},{"key":"e_1_2_1_8_2","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn N. G.","year":"1946","journal-title":"Nederl. Akad. Wetensch., Proc. Ser. A"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100109"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190170105"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"M. A.Fiol I.Alegre andJ. L. A.Yebra Line digraph iteractkon and the (d k) problem for directed graphs Proc. 10th Symp. Comp. Architecture Stockholm (1983) 174\u2013177.","DOI":"10.1145\/1067651.801653"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140608"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0497"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676323"},{"key":"e_1_2_1_16_2","unstructured":"W. H.Kauts Bouns on directed (d k) graphs Theory of cellular logic networks and machines.AFCRL\u201068\u20100668 Final Report(1968) 20\u201328."},{"key":"e_1_2_1_17_2","first-page":"249","volume-title":"Architecture and Design of Digital Computers","author":"Kautz W. H.","year":"1969"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/31.1.71"},{"key":"e_1_2_1_19_2","first-page":"269","article-title":"Maximum order digraphs for diameter 2 or degree 2, Pullman Volume of Graphs and Matrices","volume":"139","author":"Miller M.","year":"1992","journal-title":"Lecture Notes in Pure and Applied Mathematics"},{"key":"e_1_2_1_20_2","first-page":"151","article-title":"Digraph covering and its application to two optimization problems for digraphs, Australia","volume":"3","author":"Miller M.","year":"1991","journal-title":"J. Combinatorics"},{"key":"e_1_2_1_21_2","first-page":"29","article-title":"Strongly deodetic directed graphs","author":"Plesn\u00edk J.","year":"1974","journal-title":"Acta. F. R. N. Univ. Comen.\u2010Mathe."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02006150"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190200310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190200310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T06:59:08Z","timestamp":1698303548000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190200310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["10.1002\/jgt.3190200310"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190200310","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}