1 citations · 2 across the 4 of their papers we have counts for
4 papers
Total weight choosability for Halin graphs
Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu
A proper total weighting of a graph is a mapping which assigns to each vertex and each edge of a real number as its weight so that for any edge of , $\sum_{e \i…
On xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks
Sen-Peng Eu, Tung-Shan Fu, Yu-Chang Liang +1
This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal order problem in the Weyl algebra $W=\langle x,D|Dx-…
Anti-magic labeling of regular graphs
Feihuang Chang, Yu-Chang Liang, Zhishi Pan +1
A graph is antimagic if there is a one-to-one correspondence such that for any two vertices , $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(…
Regular graphs of odd degree are antimagic
Daniel W. Cranston
An antimagic labeling of a graph with edges is a bijection from to such that for all vertices and , the sum of labels on edges incident to…