S. Arumugam

collaborators

3 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 $χ (G)$ . Let $k \geq χ (G)$ and $S \subseteq V$ . Let $C_{0}$ be a $k$ -coloring of the induced subgraph $G [S]$ . The col…

math.CO2024

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 $χ (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 ca…

math.CO2024

An improved upper bound for the domination number of a graph

Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva

Let $G$ be a graph of order $n$ . A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $⌊ \frac{n}{2} ⌋$ . However, for several f…