Fei-Huang Chang

collaborators

2 papers

math.CO2026

List-distance consistent vertices in trees are confined to a path

Fei-Huang Chang, Ma-Lian Chia, David Kuo +1

A labeling of a connected graph $G$ on $n$ vertices is a bijection $c : V (G) \to {1, \dots, n}$ ; writing $c (u, v) = ∣ c (u) - c (v) ∣$ , a vertex $u$ is list-distance consistent if $d(u,v)<d(u,w…

math.CO2021

On $k$ -Shifted Antimagic Spider Forests

Fei-Huang Chang, Wei-Tian Li, Der-Fen Daphne Liu +1

Let $G (V, E)$ be a simple graph with $m$ edges. For a given integer $k$ , a $k$ -shifted antimagic labeling is a bijection $f : E (G) \to {k + 1, k + 2, \dots, k + m}$ such that all vertic…

List-distance consistent vertices in trees are confined to a path

On k-Shifted Antimagic Spider Forests

On $k$ -Shifted Antimagic Spider Forests