Qingqiong Cai

activity

20132025

most citedSome extremal results on the colorful monochromatic vertex-connectivity of a graph

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

collaborators

Showing 2019Show all

1 paper · 1 filter

math.CO2019

Integer Linear Programming Formulations for Double Roman Domination Problem

Qingqiong Cai, Neng Fan, Yongtang Shi +1

For a graph $G = (V, E)$ , a double Roman dominating function (DRDF) is a function $f : V \to {0, 1, 2, 3}$ having the property that if $f (v) = 0$ , then vertex $v$ must have at least…