Qingqiong Cai

activity

20132021

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

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

collaborators

4 papers

math.CO2021★ 1 cited

Some Results on $k$ -Critical $P_{5}$ -Free Graphs

Qingqiong Cai, Jan Goedgebeur, Shenwei Huang

A graph $G$ is $k$ -vertex-critical if $G$ has chromatic number $k$ but every proper induced subgraph of $G$ has chromatic number less than $k$ . The study of $k$ -vertex-critical gra…

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…

math.CO2015★ 3 cited

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

Qingqiong Cai, Xueliang Li, Di Wu

A path in a vertex-colored graph is called a \emph{vertex-monochromatic path} if its internal vertices have the same color. A vertex-coloring of a graph is a \emph{monochromatic ve…

math.CO2013

New skew Laplacian energy of a simple digraph

Qingqiong Cai, Xueliang Li, Jiangli Song

For a simple digraph $G$ of order $n$ with vertex set ${v_{1}, v_{2}, \dots, v_{n}}$ , let $d_{i}^{+}$ and $d_{i}^{-}$ denote the out-degree and in-degree of a vertex $v_{i}$ in $G$ , respectively.…

Some Results on k-Critical P5​-Free Graphs

Integer Linear Programming Formulations for Double Roman Domination Problem

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

New skew Laplacian energy of a simple digraph

Some Results on $k$ -Critical $P_{5}$ -Free Graphs