{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:00:47Z","timestamp":1648994447276},"reference-count":32,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p> A strict strong coloring of a graph [Formula: see text] is a proper coloring of [Formula: see text] in which every vertex of the graph is adjacent to every vertex of some color class. The minimum number of colors required for a strict strong coloring of [Formula: see text] is called the strict strong chromatic number of [Formula: see text] and is denoted by [Formula: see text]. In this paper, we characterize the results on strict strong coloring of Mycielskian graphs and iterated Mycielskian graphs. <\/jats:p>","DOI":"10.1142\/s1793830921500403","type":"journal-article","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T09:32:32Z","timestamp":1606728752000},"page":"2150040","source":"Crossref","is-referenced-by-count":0,"title":["On strict strong coloring of graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"A.","family":"Mohammed Abid","sequence":"first","affiliation":[{"name":"Department of Mathematics and Actuarial Science, B. S. Abdur Rahman Crescent Institute of Science & Technology, Chennai-600 048, Tamilnadu, India"}]},{"given":"T. R.","family":"Ramesh Rao","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Actuarial Science, B. S. Abdur Rahman Crescent Institute of Science & Technology, Chennai-600 048, Tamilnadu, India"}]}],"member":"219","published-online":{"date-parts":[[2020,11,30]]},"reference":[{"key":"S1793830921500403BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00315-5"},{"key":"S1793830921500403BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s12044-012-0092-5"},{"key":"S1793830921500403BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25011-8_2"},{"key":"S1793830921500403BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.06.013"},{"key":"S1793830921500403BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00400-X"},{"key":"S1793830921500403BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00261-2"},{"key":"S1793830921500403BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00033-3"},{"key":"S1793830921500403BIB009","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2005","edition":"4"},{"key":"S1793830921500403BIB010","volume-title":"Chromatic Graph Theory","author":"Chartrand G.","year":"2009"},{"key":"S1793830921500403BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00093-1"},{"key":"S1793830921500403BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00094-6"},{"key":"S1793830921500403BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0008-9"},{"key":"S1793830921500403BIB014","first-page":"136","volume":"111","author":"Fisher D. C.","year":"1995","journal-title":"Congr. Numer."},{"key":"S1793830921500403BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00126-1"},{"key":"S1793830921500403BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/BF01848079"},{"key":"S1793830921500403BIB017","first-page":"19","volume":"181","author":"Gera R.","year":"2006","journal-title":"Congr. Numer."},{"key":"S1793830921500403BIB018","first-page":"1","author":"Ghanbari N.","year":"2018","journal-title":"J. Inf. Optim. Sci."},{"key":"S1793830921500403BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.06.012"},{"key":"S1793830921500403BIB020","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10128"},{"key":"S1793830921500403BIB021","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S1793830921500403BIB022","volume-title":"Domination in Graphs-Advanced Topics","author":"Haynes T. W.","year":"1998"},{"issue":"1","key":"S1793830921500403BIB023","first-page":"183","volume":"34","author":"Hedetniemi S. M.","year":"2009","journal-title":"J. Combin. Inform. Systems Sci."},{"key":"S1793830921500403BIB024","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-014-1425-1"},{"key":"S1793830921500403BIB025","doi-asserted-by":"publisher","DOI":"10.37236\/1085"},{"key":"S1793830921500403BIB026","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199909)32:1<63::AID-JGT6>3.0.CO;2-B"},{"key":"S1793830921500403BIB027","first-page":"57","volume":"4","author":"Kazemi A. P.","year":"2014","journal-title":"Trans. Combin."},{"key":"S1793830921500403BIB028","first-page":"329","volume":"94","author":"Kazemi A. P.","year":"2014","journal-title":"Utilitas Math."},{"key":"S1793830921500403BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00070-4"},{"key":"S1793830921500403BIB031","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190190313"},{"key":"S1793830921500403BIB032","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-2-161-162"},{"key":"S1793830921500403BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90063-X"},{"key":"S1793830921500403BIB034","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.02.001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T09:05:15Z","timestamp":1626080715000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,30]]},"references-count":32,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10.1142\/S1793830921500403"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500403","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,30]]}}}