Yanting Zhang

collaborators

2 papers

math.CO2024

Every subcubic graph is packing $(1, 1, 2, 2, 3)$ -colorable

Xujun Liu, Xin Zhang, Yanting Zhang

For a sequence $S = (s_{1}, \dots, s_{k})$ of non-decreasing integers, a packing $S$ -coloring of a graph $G$ is a partition of its vertex set $V (G)$ into $V_{1}, \dots, V_{k}$ such that fo…

math.CO2023

The $α$ -index of graphs without intersecting triangles/quadrangles as a minor

Yanting Zhang, Ligong Wang

The $A_{α}$ -matrix of a graph $G$ is the convex linear combination of the adjacency matrix $A (G)$ and the diagonal matrix of vertex degrees $D (G)$ , i.e., $A_α(G) = αD(G) + (1 - α)A(G…

Every subcubic graph is packing (1,1,2,2,3)-colorable

The α-index of graphs without intersecting triangles/quadrangles as a minor

Every subcubic graph is packing $(1, 1, 2, 2, 3)$ -colorable

The $α$ -index of graphs without intersecting triangles/quadrangles as a minor