{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:43Z","timestamp":1740122443118,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,9]],"date-time":"2018-03-09T00:00:00Z","timestamp":1520553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10878-018-0275-9","type":"journal-article","created":{"date-parts":[[2018,3,9]],"date-time":"2018-03-09T08:04:50Z","timestamp":1520582690000},"page":"1007-1023","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The weakly connected independent set polytope in corona and join of graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6147-5101","authenticated-orcid":false,"given":"F.","family":"Bendali","sequence":"first","affiliation":[]},{"given":"J.","family":"Mailfert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,9]]},"reference":[{"key":"275_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi KM, Wan PJ, Frieder O (2003) Weakly connected dominating sets and spanners in wireless Ad Hoc networks. In: Proceedings of the 23rd international conference on distributed computing systems","DOI":"10.1109\/ICDCS.2003.1203456"},{"key":"275_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1051\/ro\/2014040","volume":"49","author":"F Bendali","year":"2015","unstructured":"Bendali F, Mailfert J, Mameri D (2015) On minimum weakly-connected independent sets for wireless sensor networks: properties and enumeration algorithm. RAIRO Oper Res 49:313\u2013334","journal-title":"RAIRO Oper Res"},{"key":"275_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2016.04.006","volume":"22","author":"F Bendali","year":"2016","unstructured":"Bendali F, Mailfert J, Mameri D (2016) The minimum weakly-connected independent set problem: polyhedral results and Branch-and-Cut. Discrete Optim 22:87\u2013110","journal-title":"Discrete Optim"},{"key":"275_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e0tal","year":"1975","unstructured":"Chv\u00e0tal V (1975) On certain polytopes associated to some graphs. J Comb Theory Series B 18:138\u2013154","journal-title":"J Comb Theory Series B"},{"key":"275_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber M (1983) Characterizations of strongly chordal graphs. Discrete Math 43:173\u2013189","journal-title":"Discrete Math"},{"key":"275_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M Farber","year":"1984","unstructured":"Farber M (1984) Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl Math 7:115\u2013130","journal-title":"Discrete Appl Math"},{"key":"275_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0012-365X(01)00273-4","volume":"252","author":"J Fonlupt","year":"2002","unstructured":"Fonlupt J, Hadjar A (2002) The stable set polytope and some operations on graphs. Discrete Math 252:123\u2013140","journal-title":"Discrete Math"},{"key":"275_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BF01844162","volume":"4","author":"R Frucht","year":"1970","unstructured":"Frucht R, Harary F (1970) On the corona of two graphs. Aequ Math 4:322\u2013325","journal-title":"Aequ Math"},{"issue":"16","key":"275_CR9","first-page":"763","volume":"6","author":"CE Go","year":"2011","unstructured":"Go CE, Canoy SR Jr (2011) Domination in the corona and join of graphs. Int Math Forum 6(16):763\u2013771","journal-title":"Int Math Forum"},{"key":"275_CR10","volume-title":"Fundamentals of domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs: advanced topics. Marcel Dekker Inc, New York"},{"issue":"36","key":"275_CR11","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.12988\/imf.2013.39170","volume":"8","author":"RE Leonida","year":"2013","unstructured":"Leonida RE (2013) Weakly connected independent domination in the join of graphs. Int Math Forum 8(36):1767\u20131771","journal-title":"Int Math Forum"},{"issue":"31","key":"275_CR12","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.12988\/imf.2013.37131","volume":"8","author":"RE Leonida","year":"2013","unstructured":"Leonida RE, Canoy SR Jr (2013) Weakly convex and weakly connected independent dominations in corona of graphs. Int Math Forum 8(31):1515\u20131522","journal-title":"Int Math Forum"},{"key":"275_CR13","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.ejc.2004.07.015","volume":"27","author":"AR Mahjoub","year":"2005","unstructured":"Mahjoub AR, Mailfert J (2005) On the independent dominating set polytope. Eur J Comb 27:601\u2013616","journal-title":"Eur J Comb"},{"key":"275_CR14","unstructured":"Mameri D (2014) L\u2019ind\u00e9pendant faiblement connexe : \u00e9tudes algorithmiques et poly\u00e8drales. Thesis, Blaise Pascal university, Clermont-Ferrand, France"},{"issue":"6","key":"275_CR15","first-page":"436","volume":"4","author":"AC Santos","year":"2009","unstructured":"Santos AC, Bendali F, Mailfert J, Duhamel C, Hou KM (2009) Heuristics for designing energy-efficient wireless sensor network topologies. J Netw 4(6):436\u2013444","journal-title":"J Netw"},{"key":"275_CR16","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin Heidelberg"},{"key":"275_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00010-013-0207-9","volume":"86","author":"IG Yero","year":"2013","unstructured":"Yero IG, Kuziak D, Aguilar AR (2013) Coloring, location and domination of corona graphs. Aequ Math 86:1\u201321","journal-title":"Aequ Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0275-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0275-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0275-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T19:33:51Z","timestamp":1552073631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0275-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["275"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0275-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,3,9]]},"assertion":[{"value":"9 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}