3 citations · 7 across the 8 of their papers we have counts for
8 papers
The restrained double Roman domination and graph operations
Zhipeng Gao, Changqing Xi, Jun Yue
Let be a simple graph. A restrained double Roman dominating function (RDRD-function) of is a function satisfying the following…
The annihilation number does not bound the 2-domination number from the above
Jun Yue, Shizhen Zhang, Yiping Zhu +2
The -domination number of a graph is the minimum cardinality of a set such that every vertex from is adjacent to at least two ve…
Exact rainbow numbers for matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi +1
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…
Proper connection number and connected dominating sets
Xueliang Li, Meiqin Wei, Jun Yue
The proper connection number of a connected graph is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of i…
The generalized 3-edge-connectivity of lexicographic product graphs
Xueliang Li, Jun Yue, Yan Zhao
The generalized -edge-connectivity of a graph is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs and , denoted…
A Turán-type problem on distance two
Xueliang Li, Jing Ma, Yongtang Shi +1
A new turán-type problem on distances on graphs was introduced by Tyomkyn and Uzzell. In this paper, we focus on the case that the distance is two. We primely show that for any val…