Yunfang Tang

activity

20152024

most citedAsymptotically optimal neighbor sum distinguishing total colorings of graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2024

Generalized Petersen graphs are (1,3)-choosable

Yunfang Tang, Yuting Yao

A total weighting of a graph $G$ is a mapping $ϕ$ that assigns a weight to each vertex and each edge of $G$ . The vertex-sum of $v \in V (G)$ with respect to $ϕ$ is $S_ϕ(v)=\sum_{e\i…

math.CO2023

Bounds for eccentricity-based parameters of graphs

Yunfang Tang, Xuli Qi, Douglas B. West

The \emph{eccentricity} of a vertex $u$ in a graph $G$ , denoted by $e_{G} (u)$ , is the maximum distance from $u$ to other vertices in $G$ . We study extremal problems for the average e…

math.CO2019

Linear algorithms on Steiner domination of trees

Yueming Shen, Chengye Zhao, Chenglin Gao +1

A set of vertices $W$ in a connected graph $G$ is called a Steiner dominating set if $W$ is both Steiner and dominating set. The Steiner domination number $γ_{s t} (G)$ is the minimu…

math.CO2015★ 1 cited

Asymptotically optimal neighbor sum distinguishing total colorings of graphs

Sarah Loeb, Jakub Przybyło, Yunfang Tang

Given a proper total $k$ -coloring $c : V (G) \cup E (G) \to {1, 2, \dots, k}$ of a graph $G$ , we define the value of a vertex $v$ to be $c (v) + \sum_{uv \in E (G)} c (uv)$ . The smallest int…