Yu-Chang Liang

collaborators

2 papers

math.CO2017

Total weight choosability for Halin graphs

Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu

A proper total weighting of a graph $G$ is a mapping $ϕ$ which assigns to each vertex and each edge of $G$ a real number as its weight so that for any edge $uv$ of $G$ , $\sum_{e \i…

math.CO2015

Anti-magic labeling of regular graphs

Feihuang Chang, Yu-Chang Liang, Zhishi Pan +1

A graph $G = (V, E)$ is antimagic if there is a one-to-one correspondence $f : E \to {1, 2, \dots, ∣ E ∣}$ such that for any two vertices $u, v$ , $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(…