Gee-Choon Lau

Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)

For a graph

On the k-edge magic graphs

G

On friendly index and product-cordial index sets of Möbius-liked graph

, let

Product Cordial and Total Product Cordial Labelings of

P(G,\lambda)

On k-totally magic cordial labeling of graphs

denote the chromatic polynomial of

On friendly index sets and product-cordial index sets of gear graphs

G

On Friendly Index Sets of Spiders

. Two graphs

On local antimagic chromatic number of cycle-related join graphs

G

On friendly index sets of the edge-gluing of complete graph and cycles

and

On

H