{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:24:02Z","timestamp":1753885442044,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["1266"],"award-info":[{"award-number":["1266"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:p> Let [Formula: see text] be a simple graph of order [Formula: see text]. A set [Formula: see text] is said to be a restrained set if each vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text]. The restrained polynomial of a graph [Formula: see text] is [Formula: see text] where [Formula: see text] is the number of restrained sets of [Formula: see text] of cardinality [Formula: see text]. A set [Formula: see text] is said to be a restrained dominating set if each vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text] and to a vertex in [Formula: see text]. The restrained domination polynomial of a graph [Formula: see text] is defined by [Formula: see text] where [Formula: see text] is the number of restrained dominating sets of [Formula: see text] of cardinality [Formula: see text]. In this paper, we derive restrained domination polynomial of join and corona of any two graphs. <\/jats:p>","DOI":"10.1142\/s179383092250118x","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T07:59:12Z","timestamp":1654761552000},"source":"Crossref","is-referenced-by-count":2,"title":["Restrained domination polynomial of join and corona of graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"S.","family":"Velmurugan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627012, Tamilnadu, India"}]},{"given":"R.","family":"Kala","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627012, Tamilnadu, India"}]}],"member":"219","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"key":"S179383092250118XBIB001","doi-asserted-by":"crossref","first-page":"1714","DOI":"10.1016\/j.ejc.2010.03.007","volume":"31","author":"Akbari S.","year":"2010","journal-title":"Eur. J. Combin."},{"issue":"1","key":"S179383092250118XBIB002","doi-asserted-by":"crossref","first-page":"37","DOI":"10.7494\/OpMath.2010.30.1.37","volume":"30","author":"Alikhani S.","year":"2010","journal-title":"Opuscula Math."},{"key":"S179383092250118XBIB003","first-page":"257","volume":"114","author":"Alikhani S.","year":"2014","journal-title":"Ars Combin."},{"key":"S179383092250118XBIB004","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(99)00016-3","volume":"203","author":"Domke G. S.","year":"1999","journal-title":"Disc. Maths."},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S179383092250118XBIB005"},{"issue":"5","key":"S179383092250118XBIB006","first-page":"761","volume":"22","author":"Kayathri K.","year":"2019","journal-title":"J. Disc. Maths. Sci. Crypt."},{"issue":"2","key":"S179383092250118XBIB007","doi-asserted-by":"crossref","first-page":"207","DOI":"10.26708\/IJMSC.2014.2.4.21","volume":"4","author":"Thakkar D. K.","year":"2014","journal-title":"Int. J. Maths Soft Comput."},{"issue":"130","key":"S179383092250118XBIB008","first-page":"165","volume":"55","author":"Zelinka B.","year":"2005","journal-title":"Czechoslovak Math. J."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092250118X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T03:19:40Z","timestamp":1684811980000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S179383092250118X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,28]]},"references-count":8,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10.1142\/S179383092250118X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092250118x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,6,28]]},"article-number":"2250118"}}