{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T08:06:19Z","timestamp":1653552379313},"reference-count":9,"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":[[2015,9]]},"abstract":"<jats:p> A set S \u2286 V(G) is an independent set if no two vertices of S are adjacent. An independent set S such that \u3008V - S\u3009 is connected is called an outer-connected independent set(oci-set). An oci-set is maximal if it is not a proper subset of any oci-set. The minimum and maximum cardinality of a maximal oci-set are called respectively the outer-connected independence number and the upper outer-connected independence number. This paper initiates a study of these parameters. <\/jats:p>","DOI":"10.1142\/s1793830915500391","type":"journal-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T03:50:27Z","timestamp":1439351427000},"page":"1550039","source":"Crossref","is-referenced-by-count":1,"title":["Outer-connected independence in graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"I. Sahul","family":"Hamid","sequence":"first","affiliation":[{"name":"Department of Mathematics, The Madura College, Madurai, India"}]},{"given":"R.","family":"Gnanaprakasam","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The American College, Madurai, India"}]},{"given":"M. Fatima","family":"Mary","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Fatima College, Madurai, India"}]}],"member":"219","published-online":{"date-parts":[[2015,9,29]]},"reference":[{"key":"rf1","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2005"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1978-079-5"},{"key":"rf3","volume-title":"Domination in Graphs: Advanced Topics","author":"Haynes T. W.","year":"1998"},{"key":"rf4","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"rf5","volume":"86","author":"Hedetneimi S. T.","year":"1990","journal-title":"Discrete Math."},{"key":"rf6","first-page":"35","volume":"38","author":"Cyman J.","year":"2007","journal-title":"Australas. J. Combin."},{"key":"rf7","first-page":"545","volume":"31","author":"Kulli V. R.","year":"2000","journal-title":"Indian J. Pure Appl. Math."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.1999.10697889"},{"key":"rf9","first-page":"6545","volume":"6","author":"Soner N. D.","year":"2012","journal-title":"Appl. Math. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:02:08Z","timestamp":1565186528000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2015,9,29]]},"published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.1142\/S1793830915500391"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500391","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9]]}}}