S. Arumugam

activity

20172020

most citedAlgorithmic Complexity of Secure Connected Domination in Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018

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…

On Local Antimagic Vertex Coloring for Corona Products of Graphs

On (k,d)-Hooked Skolem Graceful Graphs

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