{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T23:33:08Z","timestamp":1711495988812},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p> Let G be a simple connected graph with vertex set V(G) and edge set E(G). A function f : E(G) \u2192 {-1, 1} is called a signed star dominating function (SSDF) on G if \u2211<jats:sub>e\u2208E(v)<\/jats:sub> f(e) \u2265 1 for every v \u2208 V(G), where E(v) is the set of all edges incident to v. The signed star domination number of G is defined as \u03b3 <jats:sub>SS<\/jats:sub> (G) = min {\u2211<jats:sub>e\u2208E(G)<\/jats:sub> f(e) | f is a SSDF on G}. In this paper, we obtain exact values for the signed star domination number for certain classes of Cayley digraphs and Cayley graphs. <\/jats:p>","DOI":"10.1142\/s1793830912500176","type":"journal-article","created":{"date-parts":[[2012,6,19]],"date-time":"2012-06-19T14:55:53Z","timestamp":1340117753000},"page":"1250017","source":"Crossref","is-referenced-by-count":4,"title":["THE SIGNED STAR DOMINATION NUMBER OF CAYLEY GRAPHS"],"prefix":"10.1142","volume":"04","author":[{"given":"T. TAMIZH","family":"CHELVAM","sequence":"first","affiliation":[{"name":"Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627012, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"KALAIMURUGAN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627012, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WELL Y.","family":"CHOU","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, National Chiao Tung University, Hsinchu 300, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,6,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.09.015"},{"key":"rf2","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.016"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.01.020"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.04.008"},{"key":"rf6","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2000"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00044-9"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.11.008"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.12.007"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:42:07Z","timestamp":1565131327000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,6,21]]},"published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1142\/S1793830912500176"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500176","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}