S. Arumugam

collaborators

2 papers

math.CO2025

The k-Sudoku Number of Graphs

Manju S Nair, Aparna Lakshmanan S, S Arumugam

Let $G = (V, E)$ be a graph of order $n$ with chromatic number $I ¨ (G)$ . Let $k \geq I ¨ (G)$ and $S \subseteq V$ . Let $C_{0}$ be a $k$ -coloring of the induced subgraph $G [S]$ . The c…

math.CO2025

Sudoku Number of Corona of Graphs

Manju S Nair, Aparna Lakshmanan S, S Arumugam

Let $G = (V, E)$ be a graph of order $n$ with chromatic number $I ¨ (G) = k$ , let $S \subset V$ and let $C_{0}$ be a $k$ -coloring of the induced subgraph $G [S]$ . The coloring $C_{0}$ is c…