3 citations · 7 across the 10 of their papers we have counts for
10 papers
Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
Wenjing Zhang, Qingqiong Cai, Jou-Ming Chang
BCube, as a popular server-centric data center network (DCN), offers significant advantages in low latency, load balancing, and high bandwidth. The many-to-many paired -disjoint…
Monochromatic -connection of graphs
Qingqiong Cai, Shinya Fujita, Henry Liu +1
An edge-coloured path is monochromatic if all of its edges have the same colour. For a -connected graph , the monochromatic -connection number of , denoted by …
Some Results on -Critical -Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
A graph is -vertex-critical if has chromatic number but every proper induced subgraph of has chromatic number less than . The study of -vertex-critical gra…
Integer Linear Programming Formulations for Double Roman Domination Problem
Qingqiong Cai, Neng Fan, Yongtang Shi +1
For a graph , a double Roman dominating function (DRDF) is a function having the property that if , then vertex must have at least…
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…
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
Qingqiong Cai, Xueliang Li, Di Wu
A path in an edge-colored graph is called a \emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of is a \emph{monochromatic connection…
Note on the upper bound of the rainbow index of a graph
Qingqiong Cai, Xueliang Li, Yan Zhao
A path in an edge-colored graph , where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number…
The 3-rainbow index and connected dominating sets
Qingqiong Cai, Xueliang Li, Yan Zhao
A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of is called 3-rainbow if for any three vertices in …
The -rainbow index for complete bipartite and multipartite graphs
Qingqiong Cai, Xueliang Li, Jiangli Song
A tree in an edge-colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers , with , the \emph…
New skew Laplacian energy of a simple digraph
Qingqiong Cai, Xueliang Li, Jiangli Song
For a simple digraph of order with vertex set , let and denote the out-degree and in-degree of a vertex in , respectively.…