{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:22:02Z","timestamp":1753885322211,"version":"3.41.2"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:p> A proper vertex coloring of a graph [Formula: see text] is called a star coloring if every path on four vertices in [Formula: see text] is not 2-colored. The star chromatic number is the minimum number of colors required to star color [Formula: see text] and it is denoted by [Formula: see text]. In this paper, the star coloring of Harary graphs [Formula: see text], where [Formula: see text] is even and [Formula: see text] is odd, is discussed. <\/jats:p>","DOI":"10.1142\/s1793830921500695","type":"journal-article","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T03:21:58Z","timestamp":1607138518000},"source":"Crossref","is-referenced-by-count":0,"title":["Star chromatic number of Harary graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"Chitra","family":"Suseendran","sequence":"first","affiliation":[{"name":"Department of Mathematics, Ethiraj College for Women, Chennai-600008, India"}]},{"given":"Fathima","family":"Tabrez","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Anna University, Chennai-600025, India"}]}],"member":"219","published-online":{"date-parts":[[2020,12,30]]},"reference":[{"issue":"9","key":"S1793830921500695BIB001","first-page":"4569","volume":"13","author":"Bibi K. Ameenal","year":"2017","journal-title":"Global J. Pure Appl. Math."},{"issue":"23","key":"S1793830921500695BIB002","first-page":"0975","volume":"44","author":"Arundhadhi R.","year":"2012","journal-title":"Int. J. Comput. Appl."},{"key":"S1793830921500695BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"S1793830921500695BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF02764716"},{"key":"S1793830921500695BIB005","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1672"},{"key":"S1793830921500695BIB006","doi-asserted-by":"publisher","DOI":"10.1515\/tmj-2016-0013"},{"key":"S1793830921500695BIB007","series-title":"Springer Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-45477-2_14","volume-title":"Graph Theoretic Ideas in Computer Science \u2014 27th International Workshop","volume":"2204","author":"Raspaud A.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T11:33:39Z","timestamp":1638963219000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,30]]},"references-count":7,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S1793830921500695"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500695","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,12,30]]},"article-number":"2150069"}}