3 papers
math.CO2020
Bounds for the rainbow disconnection number of graphs
Xuqing Bai, Zhong Huang, Xueliang Li
An edge-cut of an edge-colored connected graph is called a rainbow-cut if no two edges in the edge-cut are colored the same. An edge-colored graph is rainbow disconnected if fo…
math.CO2018
The rainbow vertex-disconnection in graphs
Xuqing Bai, You Chen, Ping Li +2
Let be a nontrivial connected and vertex-colored graph. A subset of the vertex set of is called rainbow if any two vertices in have distinct colors. The graph i…
math.CO2017
Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
Dan Hu, Xueliang Li, Xiaogang Liu +1
Let be a hypergraph with vertices. Suppose that are degrees of the vertices of . The -th graph entropy based on degrees of $\…