Tao-Ming Wang

Prof. Tao-Ming Wang

Mathematics, Tunghai University, Taichung, Taiwan
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Martin BacaMartin Baca
Martin Baca
Andrea Semaničová-FeňovčíkováAndrea Semaničová-Feňovčíková
Andrea Semaničová-Feňovčíková
Tao-Ming WangTao-Ming Wang
Tao-Ming Wang
An edge labeling of a graph G=(V,E) using every label from the set {1,2,⋯,|E(G)|} exactly once is a local antimagic labeling if the vertex-weights are distinct for every pair of neighboring vertices, where a vertex-weight is the sum of labels of all edges incident with that vertex. Any local antimagic labeling induces a proper vertex coloring of G where the color of a vertex is its vertex-weight. This naturally leads to the concept of a local antimagic chromatic number. The local antimagic chromatic number is defined to be the minimum number of colors taken over all colorings of G induced by local antimagic labelings of G. In this paper, we estimate the bounds of the local antimagic chromatic number for disjoint union of multiple copies of a graph.

23 July 2020 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
KPK. Premalatha
K. Premalatha
SAS. Arumugam
S. Arumugam
YLYi-Chun Lee
Yi-Chun Lee
Tao-Ming WangTao-Ming Wang
Tao-Ming Wang
Let G = (V, E) be a connected graph with |V|= n and |E|= m. A bijection f : E → {1, 2, … , m} is called a local antimagic lableing if for any two adjacent vertices u and v, w(u) ≠ w(v), where w(u)= ∑ e ϵE(u) f (e) and E(u) is the set of edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of G where the vertex v is assigned the color w(v). The local antimagic chromatic number χla (G) is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper we determine the local antimagic chromatic number of several families of trees.

1 January 2015 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
Martin BacaMartin Baca
Martin Baca
Andrea Semaničová-FeňovčíkováAndrea Semaničová-Feňovčíková
Andrea Semaničová-Feňovčíková
Tao-Ming WangTao-Ming Wang
Tao-Ming Wang
GZGuang-Hui Zhang
Guang-Hui Zhang
An(a,s)-vertex-antimagic edge labeling(or an(a,s)-VAElabeling, for short) ofGis a bijective mapping from the edge setE(G)of a graphGto the set of integers1,2,…,|E(G)|with the property that the vertex-weights form an arithmetic sequence starting fromaand having common differences, whereaandsare two positive integers, and the vertex-weight is the sum of the labels of all edges incident to the vertex. A graph is called(a,s)-antimagic if it admits an(a,s)-VAElabeling. In this paper, we investigate the existence of(a,1)-VAE labeling for disconnected 3-regular graphs. Also, we define and study a new concept(a,s)-vertex-antimagic edge deficiency, as an extension of(a,s)-VAE labeling, for measuring how close a graph is away from being an(a,s)-antimagic graph. Furthermore, the(a,1)-VAE deficiency of Hamiltonian regular graphs of even degree is completely determined. More open problems are mentioned in the concluding remarks.

1 November 2013 in Journal of Discrete Algorithms
Verified
Journal Article
Closed access
Tao-Ming WangTao-Ming Wang
Tao-Ming Wang
GZGuang-Hui Zhang
Guang-Hui Zhang

1 April 2018 in AKCE International Journal of Graphs and Combinatorics
Verified
Journal Article
Open access
Tao-Ming WangTao-Ming Wang
Tao-Ming Wang
GZGuang-Hui Zhang
Guang-Hui Zhang
An edge-graceful labeling of a finite simple graph with p p <!--mathContainer--> <!--Loading Mathjax--> vertices and q q <!--mathContainer--> <!--Loading Mathjax--> edges is a bijection from the set of edges to the set of integers {1,2,…,q} {1,2,…,q} <!--mathContainer--> <!--Loading Mathjax--> such that the vertex sums are pairwise distinct modulo p p <!--mathContainer--> <!--Loading Mathjax--> , where the vertex sum at a vertex is the sum of labels of all edges incident to such vertex. A graph is called edge-graceful if it admits an edge-graceful labeling. In 2005 Hefetz (2005) proved that a regular graph of even degree is edge-graceful if it contains a 2-factor consisting of mCn mCn <!--mathContainer--> <!--Loading Mathjax--> , where m,n m,n <!--mathContainer--> <!--Loading Mathjax--> are odd. In this article, we show that a regular graph of odd degree is edge-graceful if it contains either of two particular 3-factors, namely, a claw factor and a quasi-prism factor. We also introduce a new notion called edge-graceful deficiency, which is a parameter to measure how close a graph is away from being an edge-graceful graph. In particular the edge-graceful deficiency of a regular graph of even degree containing a Hamiltonian cycle is completely determined.

6 December 2008 in Discrete Mathematics
Verified
Journal Article
Closed access
Tao-Ming WangTao-Ming Wang
Tao-Ming Wang
CHCheng-Chih Hsiao
Cheng-Chih Hsiao
SLSin-Min Lee
Sin-Min Lee