Zehui Shao

activity

20132022

most citedOuter independent double Roman domination number of graphs

12 citations · 18 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2019★ 3 cited

On the packing coloring of base-3 Sierpiński and $H$ graphs

Fei Deng, Zehui Shao, Aleksander Vesel

For a nondecreasing sequence of integers $S = (s_{1}, s_{2}, \dots)$ an $S$ -packing $k$ -coloring of a graph $G$ is a mapping from $V (G)$ to ${1, 2, \dots, k}$ such that vertices with c…

math.CO2018

Changing and unchanging 2-rainbow independent domination

Pu Wu, Zehui Shao, Vladimir Samodivkin +3

For a function $f : V (G) \to {0, 1, 2}$ we denote by $V_{i}$ the set of vertices to which the value $i$ is assigned by $f$ , i.e. $V_{i} = {x \in V (G) : f (x) = i}$ . If…

math.CO2018★ 2 cited

The characterization of perfect Roman domination stable trees

Zepeng Li, Zehui Shao, Yongsheng Rao +2

A \emph{perfect Roman dominating function} (PRDF) on a graph $G = (V, E)$ is a function $f : V \to {0, 1, 2}$ satisfying the condition that every vertex $u$ for which $f(…

math.CO2014

Tree-colorable maximal planar graphs

Enqiang Zhu, Zepeng Li, Zehui Shao +1

A tree-coloring of a maximal planar graph is a proper vertex $4$ -coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph $G$ is t…

math.CO2013

Size of edge-critical uniquely 3-colorable planar graphs

Zepeng Li, Enqiang Zhu, Zehui Shao +1

A graph $G$ is \emph{uniquely k-colorable} if the chromatic number of $G$ is $k$ and $G$ has only one $k$ -coloring up to permutation of the colors. A uniquely $k$ -colorable graph $…