Baoyindureng Wu

activity

20092025

most citedEigenvalues and triangles in graphs

84 citations · 112 across the 20 of their papers we have counts for

collaborators

Showing 2015Show all

5 papers · 1 filter

math.CO2015★ 2 cited

Upper bounds for the achromatic and coloring numbers of a graph

Baoyindureng Wu, Clive Elphick

Dvořák \emph{et al.} introduced a variant of the Randić index of a graph $G$ , denoted by $R^{'} (G)$ , where $R^{'} (G) = \sum_{uv \in E (G)} \frac{1}{m a x { d ( u ) , d ( v )}}$ , and $d (u)$ denotes th…

math.CO2015

Remoteness and distance eigenvalues of a graph

Huiqiu Lin, Kinkar Ch. Das, Baoyindureng Wu

Let $G$ be a connected graph of order $n$ with diameter $d$ . Remoteness $ρ$ of $G$ is the maximum average distance from a vertex to all others and $\partial_1\geq\cdots\geq \partia…

math.CO2015

Proof of a conjecture on the zero forcing number of a graph

Leihao Lu, Baoyindureng Wu, Zixing Tang

Amos et al. (Discrete Appl. Math. 181 (2015) 1-10) introduced the notion of the $k$ -forcing number of graph for a positive integer $k$ as the generalization of the zero forcing num…

math.CO2015★ 3 cited

More bounds for the Grundy number of graphs

Zixing Tang, Baoyindureng Wu, Lin Hu +1

A coloring of a graph $G = (V, E)$ is a partition ${V_{1}, V_{2}, \dots, V_{k}}$ of $V$ into independent sets or color classes. A vertex $v \in V_{i}$ is a Grundy vertex if it is adjacent t…

math.CO2015★ 6 cited

Total [1,2]-domination in graphs

Xuezheng Lv, Baoyindureng Wu

A subset $S \subseteq V$ in a graph $G = (V, E)$ is a total $[1, 2]$ -set if, for every vertex $v \in V$ , $1 \leq ∣ N (v) \cap S ∣ \leq 2$ . The minimum cardinality of a total $[1, 2]$ -set of $G$ …