{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:45:03Z","timestamp":1648683903536},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p> A set S of vertices of a graph G is an outer-connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V\\S is connected. The outer-connected domination number [Formula: see text] is the minimum size of such a set. We present an infinite family of 2-connected cubic graphs, in which the number of vertices in a longest path are much less than the half of their orders. This disprove a recent conjecture posed by Akhbari, Hasni, Favaron, Karami, Sheikholeslami. <\/jats:p>","DOI":"10.1142\/s1793830914500323","type":"journal-article","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T00:48:52Z","timestamp":1392857332000},"page":"1450032","source":"Crossref","is-referenced-by-count":0,"title":["Outer-connected domination in 2-connected cubic graphs"],"prefix":"10.1142","volume":"06","author":[{"given":"Shipeng","family":"Wang","sequence":"first","affiliation":[{"name":"College of Mathematics and System Science, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]},{"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Science, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]},{"given":"Xinhui","family":"An","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Science, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}]},{"given":"Xiaoping","family":"Liu","sequence":"additional","affiliation":[{"name":"Foundation Department, Xinjiang Institute of Engineering, Urumqi, Xinjiang 830000, P. R. China"}]},{"given":"Xingchao","family":"Deng","sequence":"additional","affiliation":[{"name":"Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, 300071, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2014,6,16]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9427-x"},{"key":"rf2","first-page":"35","volume":"38","author":"Cyman J.","journal-title":"Australas. J. Combin."},{"key":"rf3","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"rf4","first-page":"265","volume":"81","author":"Jiang H.","journal-title":"Util. Math."},{"key":"rf5","volume-title":"Cycles and Bridges in Graphs","author":"Voss H.-J.","year":"1991"},{"key":"rf6","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:15:47Z","timestamp":1565097347000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,16]]},"references-count":6,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2014,6,16]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S1793830914500323"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500323","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,16]]}}}