K. Premalatha

activity

20182024

most citedOn Local Antimagic Vertex Coloring for Corona Products of Graphs

12 citations · 14 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2024

Construction of local antimagic 3-colorable graphs of fixed even size -- matrix approach

Gee-Choon Lau, Wai Chee Shiu, M. Nalliah +1

An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f : E \to {1, \dots, ∣ E ∣}$ such that for any pair of adjacent vertices $x$ and…

math.CO2024

Constructions of local antimagic 3-colorable graphs of fixed odd size | matrix approach

Gee-Choon Lau, Wai Chee Shiu, K. Premalatha +1

An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if there is a bijection $f : E \to {1, \dots, ∣ E ∣}$ such that for any pair of adjacent vertices $x$ …

math.CO2022★ 2 cited

Complete characterization of s-bridge graphs with local antimagic chromatic number 2

Gee-Choon Lau, Wai-Chee Shiu, Ruixue Zhang +2

An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f : E \to {1, \dots, ∣ E ∣}$ such that for any pair of adjacent vertices $x$ and…

math.CO2022

A note on local antimagic chromatic number of lexicographic product graphs

Gee-Choon Lau, Wai-Chee Shiu, K. Premalatha +2

Let $G = (V, E)$ be a connected simple graph. A bijection $f : E \to {1, 2, \dots, ∣ E ∣}$ is called a local antimagic labeling of $G$ if $f^{+} (u) \neq = f^{+} (v)$ holds for any two…

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…