{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T19:51:09Z","timestamp":1769716269899,"version":"3.49.0"},"reference-count":10,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2023,7,2]]},"abstract":"<jats:p>A signed graph \u03a3\u00a0=\u00a0(G, \u03c3) is a graph with a sign attached to each arc. A subset S of V\u00a0(\u03a3) is called a dominating set of \u03a3 if |N+\u00a0(v)\u00a0\u00a0\u2229\u00a0S|\u00a0&gt;\u00a0|N-\u00a0(v)\u00a0\u00a0\u2229\u00a0S| for all v\u00a0\u2208\u00a0V\u00a0-\u00a0S\u00a0. A dominating set S\u00a0\u2286\u00a0V is a connected dominating set of \u03a3 if &lt;S&gt; is connected. The minimum cardinality of a connected dominating set of \u03a3 denoted by \u03b3sc, is called the connected domination number of \u03a3\u00a0. In this paper, we introduce the connected domination number in a signed graph \u03a3 and study different bounds and characterization of the connected domination number in a signed graph \u03a3\u00a0. Furthermore, we find the best possible upper and lower bounds for \u03b3 sc ( \u03a3 ) + \u03b3 sc ( \u03a3 \u03b1 c ) where \u03a3 is connected.<\/jats:p>","DOI":"10.3233\/jifs-223857","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T12:06:44Z","timestamp":1682424404000},"page":"345-356","source":"Crossref","is-referenced-by-count":0,"title":["Connected domination in a signed graph and its complement"],"prefix":"10.1177","volume":"45","author":[{"given":"P.","family":"Jeyalakshmi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil, India"}]},{"given":"K.","family":"Karuppasamy","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil, India"}]}],"member":"179","reference":[{"issue":"2013","key":"10.3233\/JIFS-223857_ref1","first-page":"1","article-title":"Domination and absorbence in signed graph and digraph: I. Foundations","volume":"84","author":"Acharya","journal-title":"The Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"10.3233\/JIFS-223857_ref2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.17654\/AADMApr2015_101_112","article-title":"On minimal dominating sets for signed graphs","volume":"15","author":"Ashraf","year":"2015","journal-title":"Advances and Applications in Discrete Mathematics"},{"key":"10.3233\/JIFS-223857_ref4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","article-title":"On the notion of balance of a signed graph","volume":"2","author":"Harary","year":"1953","journal-title":"Michigan Math J"},{"key":"10.3233\/JIFS-223857_ref5","unstructured":"Harary F. , Graph Theory, Addison-Wesley, Reading, MA, (1972)."},{"key":"10.3233\/JIFS-223857_ref6","unstructured":"Haynes T.W. , Hedetniemi S.T. and Slater P.J. , (Eds.), Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998."},{"issue":"01","key":"10.3233\/JIFS-223857_ref7","doi-asserted-by":"crossref","first-page":"2050094","DOI":"10.1142\/S1793830920500949","article-title":"Domination in Signed Graphs","volume":"13","author":"Jeyalakshmi","year":"2021","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"10.3233\/JIFS-223857_ref8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer Math Monthly"},{"issue":"6","key":"10.3233\/JIFS-223857_ref9","first-page":"607","article-title":"The connected domination number of a graph","volume":"13","author":"Sampathkumar","journal-title":"J Math Phys Sci"},{"issue":"1-4","key":"10.3233\/JIFS-223857_ref10","first-page":"107","article-title":"Signed domination in signed graph","volume":"40","author":"Walikar","year":"2015","journal-title":"J Comb Inf Syst Sci"},{"key":"10.3233\/JIFS-223857_ref11","first-page":"1","article-title":"A Mathematical Bibliography of Signed and Gained Graphs and Allied Areas","volume":"6","author":"Zaslavsky","year":"2005","journal-title":"Electron J Comb"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-223857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T09:26:40Z","timestamp":1769678800000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-223857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,2]]},"references-count":10,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-223857","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,2]]}}}