{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T22:31:09Z","timestamp":1726439469218},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,6]]},"abstract":"<jats:p> Coloring the vertices of a graph [Formula: see text] according to certain conditions can be considered as a random experiment and a discrete random variable [Formula: see text] can be defined as the number of vertices having a particular color in the proper coloring of [Formula: see text]. The concepts of mean and variance, two important statistical measures, have also been introduced to the theory of graph coloring and determined the values of these parameters for a number of standard graphs. In this paper, we discuss the coloring parameters of the Mycielskian of certain standard graphs. <\/jats:p>","DOI":"10.1142\/s1793830918500301","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T04:01:57Z","timestamp":1519272117000},"page":"1850030","source":"Crossref","is-referenced-by-count":1,"title":["On certain coloring parameters of Mycielski graphs of some graphs"],"prefix":"10.1142","volume":"10","author":[{"given":"N. K.","family":"Sudev","sequence":"first","affiliation":[{"name":"Centre for Studies in Discrete Mathematics, Vidya Academy of Science &amp; Technology, Thrissur 680501, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. P.","family":"Chithra","sequence":"additional","affiliation":[{"name":"Naduvath Mana, Nandikkara, Thrissur 680501, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. A.","family":"Germina","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Central University of Kerala, Kasaragod, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Satheesh","sequence":"additional","affiliation":[{"name":"Centre for Studies in Discrete Mathematics, Vidya Academy of Science &amp; Technology, Thrissur 680501, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Kok","sequence":"additional","affiliation":[{"name":"Centre for Studies in Discrete Mathematics, Vidya Academy of Science &amp; Technology, Thrissur 680501, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,6,3]]},"reference":[{"key":"S1793830918500301BIB001","first-page":"51","volume-title":"Models, Algorithms, and Technologies for Network Analysis","author":"Batsyn M.","year":"2012"},{"key":"S1793830918500301BIB002","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"S1793830918500301BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"volume-title":"Introduction to Graph Theory","year":"2005","author":"Chartrand G.","key":"S1793830918500301BIB004"},{"volume-title":"Chromatic Graph Theory","year":"2009","author":"Chartrand G.","key":"S1793830918500301BIB005"},{"volume-title":"Graph Theory","year":"2001","author":"Harary F.","key":"S1793830918500301BIB006"},{"volume-title":"Graph Coloring Problems","year":"1995","author":"Jensen T. R.","key":"S1793830918500301BIB007"},{"key":"S1793830918500301BIB008","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/352"},{"key":"S1793830918500301BIB009","doi-asserted-by":"publisher","DOI":"10.1080\/23311835.2016.1140002"},{"key":"S1793830918500301BIB011","doi-asserted-by":"publisher","DOI":"10.1155\/S0161171204306216"},{"key":"S1793830918500301BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.11.001"},{"volume-title":"An Introduction to Probability and Statistics","year":"2001","author":"Rohatgi V. K.","key":"S1793830918500301BIB013"},{"volume-title":"Introduction to Probability and Statistics for Engineers and Scientists","year":"2004","author":"Ross S. M.","key":"S1793830918500301BIB014"},{"key":"S1793830918500301BIB015","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500506"},{"key":"S1793830918500301BIB017","doi-asserted-by":"publisher","DOI":"10.1142\/S179383091650052X"},{"issue":"6","key":"S1793830918500301BIB018","first-page":"909","volume":"41","author":"Sudev N. K.","year":"2017","journal-title":"Southeast Asian Bull. Math."},{"key":"S1793830918500301BIB019","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830917500549"},{"volume-title":"Introduction to Graph Theory","year":"2001","author":"West D. B.","key":"S1793830918500301BIB021"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:59:21Z","timestamp":1565099961000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":18,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2018,6,3]]},"published-print":{"date-parts":[[2018,6]]}},"alternative-id":["10.1142\/S1793830918500301"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500301","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}