36 citations · 45 across the 8 of their papers we have counts for
6 papers · 1 filter
Uniformly most reliable three-terminal graph of dense graphs
Sun Xie, Haixing Zhao, Jun Yin
A graph with specified target vertices in vertex set is a -terminal graph. The -terminal reliability is the connection probability of the fixed target vertices in…
Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs
Hong Chang, Zhong Huang, Xueliang Li +2
An edge-colored graph is \emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The…
Conflict-free vertex-connections of graphs
Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2
A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…
Conflict-free connection numbers of line graphs
Bo Deng, Wenjing Li, Xueliang Li +2
A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph is \emph{conflict-free…
On the Equitable Vertex Arboricity of Graphs
Yaping Mao, Zhiwei Guo, Hongjian Lai +1
The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu, Zhang and Li introduced the concept of equitable $(t,k)…
On the regular k-independence number of graphs
Zhiwei Guo, Haixing Zhao, Hongjian Lai +1
The \emph{regular independence number}, introduced by Albertson and Boutin in 1990, is the maximum cardinality of an independent set of in which all vertices have equal degree…