Baoyindureng Wu

Minimum degree, edge-connectivity and radius

AbstractLet G be a connected graph on n≥4 vertices with minimum degree δ and radius r. Then

More bounds for the Grundy number of graphs

\delta r\leq4\lfloor\frac{n}{2}\rfloor-4

A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH

, with equality if and only if one of the following holds: (1)G is K5,(2)G≅Kn∖M, where M is a perfect matching, if n is even,(3)δ=n−3 and Δ≤n−2, if n is odd. This solves a conjecture on the product of the edge-connectivity and radius of a graph, which was posed by Sedlar, Vukičević, Aouchice, and Hansen.

A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs

A coloring of a graph

Paired-domination number of claw-free odd-regular graphs

G=(V,E)

List Point Arboricity of Dense Graphs

G=(V,E) is a partition

2-Edge connected dominating sets and 2-Connected dominating sets of a graph

\{V_1, V_2, \ldots , V_k\}