{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:45:34Z","timestamp":1770324334518,"version":"3.49.0"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> The complementary prism [Formula: see text] of a graph [Formula: see text] is the graph obtained by drawing edges between the corresponding vertices of a graph [Formula: see text] and its complement [Formula: see text]. In this paper, we generalize the concept of complementary prisms of graphs and determine the injective chromatic number of generalized complementary prisms of graphs. We prove that for any simple graph [Formula: see text] of order [Formula: see text], [Formula: see text] and if [Formula: see text] is a graph with a universal vertex, then [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500263","type":"journal-article","created":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T15:16:04Z","timestamp":1582902964000},"page":"2050026","source":"Crossref","is-referenced-by-count":1,"title":["Injective coloring of complementary prism and generalized complementary prism graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8595-1937","authenticated-orcid":false,"given":"M. R.","family":"Raksha","sequence":"first","affiliation":[{"name":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore 560029, Karnataka, India"}]},{"given":"P.","family":"Hithavarshini","sequence":"additional","affiliation":[{"name":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore 560029, Karnataka, India"}]},{"given":"Charles","family":"Dominic","sequence":"additional","affiliation":[{"name":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore 560029, Karnataka, India"}]},{"given":"N. K.","family":"Sudev","sequence":"additional","affiliation":[{"name":"Department of Mathematics, CHRIST (Deemed to be University), Bangalore 560029, Karnataka, India"}]}],"member":"219","published-online":{"date-parts":[[2020,2,28]]},"reference":[{"key":"S1793830920500263BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.08.016"},{"key":"S1793830920500263BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.01.020"},{"key":"S1793830920500263BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00466-6"},{"key":"S1793830920500263BIB004","volume-title":"Graph Theory","author":"Harary F.","year":"2001"},{"key":"S1793830920500263BIB005","first-page":"21","volume":"51","author":"Haynes T. W.","year":"2007","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830920500263BIB006","volume-title":"Introduction to Graph Theory","volume":"2","author":"West D. B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T05:59:39Z","timestamp":1589781579000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,28]]},"references-count":6,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S1793830920500263"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500263","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,28]]}}}