Zixing Tang

most citedMore bounds for the Grundy number of graphs

3 citations · 3 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2015

Proof of a conjecture on the zero forcing number of a graph

Leihao Lu, Baoyindureng Wu, Zixing Tang

Amos et al. (Discrete Appl. Math. 181 (2015) 1-10) introduced the notion of the $k$ -forcing number of graph for a positive integer $k$ as the generalization of the zero forcing num…

math.CO2015★ 3 cited

More bounds for the Grundy number of graphs

Zixing Tang, Baoyindureng Wu, Lin Hu +1

A coloring of a graph $G = (V, E)$ is a partition ${V_{1}, V_{2}, \dots, V_{k}}$ of $V$ into independent sets or color classes. A vertex $v \in V_{i}$ is a Grundy vertex if it is adjacent t…