Independence Saturation In Complementary Product Types of Graphs

Abstract

The independence saturation number IS (G) of graph (V, E) is defined as min {IS (u) V} where IS (u) is the maximum cardinality of an independent set that contains vertex Let G— be the complement graph of Complementary prisms are the subset of complementary product graphs. The complementary prism of is the graph formed from the disjoint union of and G— by adding the edges of perfect matching between the corresponding vertices of and In this paper, the independence saturation in complementary prisms are considered, then the complementary prisms with small independence saturation numbers are characterized.