S. Arumugam

activity

20172020

most citedOn Local Antimagic Vertex Coloring for Corona Products of Graphs

12 citations · 13 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DM2020★ 1 cited

Algorithmic Complexity of Secure Connected Domination in Graphs

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

Let $G = (V, E)$ be a simple, undirected and connected graph. A connected (total) dominating set $S \subseteq V$ is a secure connected (total) dominating set of $G$ , if for each $ u…

math.CO2018★ 12 cited

On Local Antimagic Vertex Coloring for Corona Products of Graphs

S. Arumugam, Yi-Chun Lee, K. Premalatha +1

Let $G = (V, E)$ be a finite simple undirected graph without $K_{2}$ components. A bijection $f : E \to {1, 2, \dots, ∣ E ∣}$ is called a {\bf local antimagic labeling} if fo…

math.CO2017

On $(k, d)$ -Hooked Skolem Graceful Graphs

Jessica Pereira, Tarkeshwar Singh, S. Arumugam

A graph $(p, q)$ graph $G = (V, E)$ is said to be $(k, d)$ -hooked Skolem graceful if there exists a bijection $f : V (G) \to {1, 2, \dots, p - 1, p + 1}$ such that the induced e…

Algorithmic Complexity of Secure Connected Domination in Graphs

On Local Antimagic Vertex Coloring for Corona Products of Graphs

On (k,d)-Hooked Skolem Graceful Graphs

On $(k, d)$ -Hooked Skolem Graceful Graphs