Universiti Teknologi MARA

output

20002025

most citedOn local antimagic chromatic number of cycle-related join graphs

18 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2018Show all

4 papers · 1 filter

cs.CR2018★ 3 cited

A Security Analysis of IoT Encryption: Side-channel Cube Attack on Simeck32/64

Alya Geogiana Buja, Shekh Faisal Abdul-Latip, Rabiah Ahmad

Simeck, a lightweight block cipher has been proposed to be one of the encryption that can be employed in the Internet of Things (IoT) applications. Therefore, this paper presents t…

math.CO2018

Further Results On k-Super Graceful Graphs

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng +2

Let $G = (V (G), E (G))$ be a simple, finite and undirected graph of order $p$ and size $q$ . For $k \geq 1$ , a bijection $f : V (G) \cup E (G) \to {k, k + 1, k + 2, \dots, k + p + q - 1}$ such that…

math.CO2018★ 18 cited

On local antimagic chromatic number of cycle-related join graphs

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng

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.CO2018★ 2 cited

On local antimagic chromatic number of graphs with cut-vertices

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng

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…