Injective coloring of complementary prism and generalized complementary prism graphs
M. R. Raksha, P Hithavarshini, Charles Dominic, Sudev Naduvath · Discrete Mathematics Algorithms and Applications · 2020
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].