{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:20Z","timestamp":1740155960852,"version":"3.37.3"},"reference-count":20,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,10]]},"abstract":"<jats:p> Let [Formula: see text] be a connected simple graph. A set [Formula: see text] is a doubly connected dominating set if it is dominating and both [Formula: see text] and [Formula: see text] are connected. A nonempty subset [Formula: see text] of the vertex set [Formula: see text] is a clique in [Formula: see text] if the graph [Formula: see text] induced by [Formula: see text] is complete. A clique dominating set [Formula: see text] of [Formula: see text] is a clique doubly connected dominating set if [Formula: see text] is a doubly connected dominating set of [Formula: see text]. The clique doubly connected domination number of [Formula: see text], denoted by [Formula: see text], is the smallest cardinality of a clique doubly connected dominating set [Formula: see text] of [Formula: see text]. In this paper, we give the characterization of the clique doubly connected dominating set and the clique doubly connected domination number in the join (and lexicographic product) of two graphs. <\/jats:p>","DOI":"10.1142\/s1793830920500664","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T09:22:23Z","timestamp":1595409743000},"page":"2050066","source":"Crossref","is-referenced-by-count":1,"title":["Clique doubly connected domination in the join and lexicographic product of graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1521-156X","authenticated-orcid":false,"given":"Enrico L.","family":"Enriquez","sequence":"first","affiliation":[{"name":"Department of Computer, Information Sciences and Mathematics, School of Arts and Sciences, University of San Carlos, 6000 Cebu City, Philippines"}]},{"given":"Albert D.","family":"Ngujo","sequence":"additional","affiliation":[{"name":"Department of Computer, Information Sciences and Mathematics, School of Arts and Sciences, University of San Carlos, 6000 Cebu City, Philippines"}]}],"member":"219","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"issue":"31","key":"S1793830920500664BIB001","first-page":"1521","volume":"8","author":"Arriola B.","year":"2014","journal-title":"Appl. Math. Sci."},{"issue":"135","key":"S1793830920500664BIB002","first-page":"6723","volume":"9","author":"Aunzo R. T.","year":"2015","journal-title":"Appl. Math. Sci."},{"volume-title":"A First Course in Graph Theory","year":"2012","author":"Chartrand G.","key":"S1793830920500664BIB003"},{"issue":"116","key":"S1793830920500664BIB004","first-page":"5749","volume":"9","author":"Daniel T. V.","year":"2015","journal-title":"Appl. Math. Sci."},{"key":"S1793830920500664BIB005","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500081"},{"issue":"78","key":"S1793830920500664BIB006","first-page":"3867","volume":"9","author":"Enriquez E. L.","year":"2015","journal-title":"Appl. Math. Sci."},{"key":"S1793830920500664BIB007","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2015.54127"},{"key":"S1793830920500664BIB008","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2015.412412"},{"issue":"9","key":"S1793830920500664BIB009","first-page":"1","volume":"6","author":"Estrada G. M.","year":"2019","journal-title":"J. Global Res. Math. Arch."},{"issue":"3","key":"S1793830920500664BIB010","first-page":"115","volume":"2","author":"Gupta P.","year":"2013","journal-title":"Indian J. Res."},{"key":"S1793830920500664BIB011","first-page":"6676","volume":"9","author":"Kiunisala E. M.","year":"2016","journal-title":"Int. J. Appl. Eng. Res."},{"issue":"3","key":"S1793830920500664BIB012","first-page":"2075","volume":"12","author":"Kiunisala E. M.","year":"2016","journal-title":"Global J. Pure Appl. Math."},{"key":"S1793830920500664BIB013","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500135"},{"key":"S1793830920500664BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10587-012-0060-3"},{"issue":"7","key":"S1793830920500664BIB015","first-page":"4707","volume":"11","author":"Loquias C. M.","year":"2016","journal-title":"Int. J. Appl. Eng. Res."},{"issue":"2","key":"S1793830920500664BIB016","first-page":"23","volume":"4","author":"Loquias C. M.","year":"2017","journal-title":"Recoletos Multidiscipl. Res. J."},{"key":"S1793830920500664BIB017","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500111"},{"key":"S1793830920500664BIB018","first-page":"2001","volume":"3","author":"Punzalan T. J.","year":"2016","journal-title":"Global J. Pure Appl. Math."},{"issue":"1","key":"S1793830920500664BIB019","first-page":"1","volume":"12","author":"Salve D. P.","year":"2016","journal-title":"Global J. Pure Appl. Math."},{"key":"S1793830920500664BIB020","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500020"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T07:24:24Z","timestamp":1601623464000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,22]]},"references-count":20,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["10.1142\/S1793830920500664"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500664","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,7,22]]}}}