On the Independence Number of the Modular Product

Abstract

The \emph{modular product} $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g',h')$ of $G\diamond H$ are adjacent if $g=g'$ and $hh'\in E(H)$, or $gg'\in E(G)$ and $h=h'$, or $gg'\in E(G)$ and $hh'\in E(H)$, or (for $g\neq g'$ and $h\neq h'$) $gg'\notin E(G)$ and $hh'\notin E(H)$. The independence number $α(G)$ of a graph $G$ is the maximum cardinality of a set of pairwise nonadjacent vertices in $G$. In this paper, we study the independence number of the modular product of graphs. We first structurally characterize all independent set of $G\diamond H$ which lead to the exact result on $α(G \diamond H)$. Special cases of this result lead to several sharp bounds and some exact results for $α(G \diamond H)$. Finally, we introduce a partition graph associated with $G \diamond H$ that provides a framework for constructing independent sets of the modular product from independent sets of its substructures.