{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:15:51Z","timestamp":1753884951445,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p> A dominating set [Formula: see text] is called a connected co-independent dominating set of [Formula: see text], where [Formula: see text] is a finite simple undirected graph, if [Formula: see text] is a connected dominating set of [Formula: see text] and [Formula: see text] is an independent set. The minimum cardinality of such a set, denoted by [Formula: see text], is called the connected co-independent domination number of [Formula: see text]. In this paper, we study this concept and the corresponding parameter in graphs resulting from the join, corona and lexicographic product of two graphs. Specifically, we characterize the connected co-independent dominating sets in these types of graphs and determine the exact values of their connected co-independent domination numbers. <\/jats:p>","DOI":"10.1142\/s1793830922501117","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T15:57:49Z","timestamp":1652371069000},"source":"Crossref","is-referenced-by-count":1,"title":["On connected co-independent domination in the join, corona and lexicographic product of graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Reyna Mae L.","family":"Detalla","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science and Mathematics, Mindanao State University-Iligan Institute of Technology, Tibanga Iligan City, Philippines"}]},{"given":"Marlou T.","family":"Perocho","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science and Mathematics, Mindanao State University-Iligan Institute of Technology, Tibanga Iligan City, Philippines"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5867-724X","authenticated-orcid":false,"given":"Helen M.","family":"Rara","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science and Mathematics, Center for Graph Theory, Algebra and Analysis-Premier Research, Institute of Science and Mathematics, Mindanao State University-Iligan, Institute of Technology, 9200, Iligan City, Philippines"}]},{"suffix":"Jr.","given":"Sergio R.","family":"Canoy","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science and Mathematics, Center for Graph Theory, Algebra and Analysis-Premier Research, Institute of Science and Mathematics, Mindanao State University-Iligan, Institute of Technology, 9200, Iligan City, Philippines"}]}],"member":"219","published-online":{"date-parts":[[2022,6,14]]},"reference":[{"issue":"2","key":"S1793830922501117BIB001","doi-asserted-by":"crossref","first-page":"2150009","DOI":"10.1142\/S1793830921500099","volume":"13","author":"Abdlhussein M. A.","year":"2021","journal-title":"Discrete Math. Algorithms Appl."},{"volume-title":"Theory of Graphs and its Applications","year":"1962","author":"Berge C.","key":"S1793830922501117BIB002"},{"key":"S1793830922501117BIB003","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"Cockayne E. J.","year":"1977","journal-title":"Networks"},{"key":"S1793830922501117BIB004","first-page":"423","volume":"6","author":"Gayathri B.","year":"2011","journal-title":"Int. J. Contemp. Math. Sci."},{"issue":"5","key":"S1793830922501117BIB005","doi-asserted-by":"crossref","first-page":"2150057","DOI":"10.1142\/S1793830921500579","volume":"13","author":"Mollejon R. V.","year":"2021","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501117BIB006","doi-asserted-by":"crossref","first-page":"2250016","DOI":"10.1142\/S1793830922500161","author":"Monsanto G. B.","year":"2022","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501117BIB007","series-title":"American Mathematical Society Colloquium Publications","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","volume":"38","author":"Ore O.","year":"1962"},{"issue":"5","key":"S1793830922501117BIB008","doi-asserted-by":"crossref","first-page":"2150055","DOI":"10.1142\/S1793830921500555","volume":"13","author":"Poureidi A.","year":"2021","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"3","key":"S1793830922501117BIB009","doi-asserted-by":"crossref","first-page":"2250029","DOI":"10.1142\/S1793830921500294","volume":"13","author":"Sadiquali A.","year":"2021","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501117BIB010","first-page":"607","volume":"13","author":"Samphatkumar E.","year":"1979","journal-title":"J. Math. Phys. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:36:21Z","timestamp":1682850981000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,14]]},"references-count":10,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S1793830922501117"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501117","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,6,14]]},"article-number":"2250111"}}