{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T01:35:11Z","timestamp":1722303311690},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p> A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected degree r, maximum directed out-degree z and diameter k is given by the mixed Moore bound. Graphs with order attaining the Moore bound are known as Moore graphs, and they are very rare. Besides, graphs with prescribed parameters and order one less than the corresponding Moore bound are known as almost Moore graphs. In this paper we prove that there is a unique mixed almost Moore graph of diameter k = 2 and parameters r = 2 and z = 1. <\/jats:p>","DOI":"10.1142\/s0219265917410055","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T08:47:39Z","timestamp":1513327659000},"page":"1741005","source":"Crossref","is-referenced-by-count":4,"title":["The Unique Mixed Almost Moore Graph with Parameters <i>k<\/i> = 2, <i>r<\/i> = 2 and <i>z<\/i> = 1"],"prefix":"10.1142","volume":"17","author":[{"given":"DOMINIQUE","family":"BUSET","sequence":"first","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NACHO","family":"L\u00d3PEZ","sequence":"additional","affiliation":[{"name":"Departament de Matem\u00e0tica, Universitat de Lleida, C\/Jaume II 69, 25001 Lleida, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOSEP M.","family":"MIRET","sequence":"additional","affiliation":[{"name":"Departament de Matem\u00e0tica, Universitat de Lleida, C\/Jaume II 69, 25001 Lleida, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"p_1","first-page":"181","volume":"29","author":"Bos\u00e1k J.","year":"1979","journal-title":"Math. Slovaca."},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.03.005"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.01.013"},{"key":"p_4","first-page":"1","volume":"2","author":"L\u00f3pez N.","year":"2016","journal-title":"The Electronic Journal of Combinatorics"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.001"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2014.08.026"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.11.009"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.11.046"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.09.059"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265917410055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:50:49Z","timestamp":1565142649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265917410055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":9,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2017,12,15]]},"published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1142\/S0219265917410055"],"URL":"https:\/\/doi.org\/10.1142\/s0219265917410055","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}