Tao-Ming Wang

activity

20132022

most citedOn local antimagic vertex coloring for complete full

t

-ary trees

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022★ 3 cited

On local antimagic vertex coloring for complete full $t$ -ary trees

Martin Bača, Andrea Semaničová-Feňovčíková, Ruei-Ting Lai +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 local antimagic labeling if for any…

math.CO2013

Set Representations of Linegraphs

Jun-Lin Guo, Tao-Ming Wang, Yue-Li Wang +1

Let $G$ be a graph with vertex set $V (G)$ and edge set $E (G)$ . A family $S$ of nonempty sets ${S_{1}, \dots, S_{n}}$ is a set representation of $G$ if there exists a one-to-…

On local antimagic vertex coloring for complete full t-ary trees

Set Representations of Linegraphs

On local antimagic vertex coloring for complete full $t$ -ary trees