{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:07:33Z","timestamp":1766178453495,"version":"3.37.3"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p> Coloring the vertices of a graph [Formula: see text] according to certain conditions is a random experiment and a discrete random variable [Formula: see text] is defined as the number of vertices having a particular color in the given type of coloring of [Formula: see text] and a probability mass function for this random variable can be defined accordingly. An equitable coloring of a graph [Formula: see text] is a proper coloring [Formula: see text] of [Formula: see text] which an assignment of colors to the vertices of [Formula: see text] such that the numbers of vertices in any two color classes differ by at most one. In this paper, we extend the concepts of arithmetic mean and variance, the two major statistical parameters, to the theory of equitable graph coloring and hence determine the values of these parameters for a number of standard graphs. <\/jats:p>","DOI":"10.1142\/s1793830917500549","type":"journal-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T06:49:02Z","timestamp":1499669342000},"page":"1750054","source":"Crossref","is-referenced-by-count":7,"title":["On certain parameters of equitable coloring of graphs"],"prefix":"10.1142","volume":"09","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9692-4053","authenticated-orcid":false,"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 680301, 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":[[2017,8,16]]},"reference":[{"volume-title":"Graph Theory with Application","year":"1982","author":"Bondy J. A.","key":"S1793830917500549BIB001"},{"volume-title":"Chromatic Graph Theory","year":"2009","author":"Chartrand G.","key":"S1793830917500549BIB002"},{"key":"S1793830917500549BIB003","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1032"},{"key":"S1793830917500549BIB004","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1994.1047"},{"volume-title":"Graph Theory","year":"2001","author":"Harary F.","key":"S1793830917500549BIB006"},{"volume-title":"Graph Coloring Problems","year":"1995","author":"Jensen T. R.","key":"S1793830917500549BIB007"},{"key":"S1793830917500549BIB008","doi-asserted-by":"publisher","DOI":"10.1080\/23311835.2016.1140002"},{"key":"S1793830917500549BIB009","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/352"},{"key":"S1793830917500549BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00092-W"},{"key":"S1793830917500549BIB011","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1973.11993408"},{"volume-title":"An Introduction to Probability and Statistics","year":"2001","author":"Rohatgi V. K.","key":"S1793830917500549BIB012"},{"volume-title":"Introduction to Probability and Statistics for Engineers and Scientists","year":"2004","author":"Ross S. M.","key":"S1793830917500549BIB013"},{"key":"S1793830917500549BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500506"},{"key":"S1793830917500549BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S179383091650052X"},{"volume-title":"Introduction to Graph Theory","year":"2001","author":"West D. B.","key":"S1793830917500549BIB018"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:03:25Z","timestamp":1565096605000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":15,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2017,8,16]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S1793830917500549"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500549","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}