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 2017Show all

4 papers · 1 filter

math.CO2017

Feedback vertex number of Sierpiński-type graphs

LiLi Yuan, Baoyindureng Wu, Biao Zhao

The feedback vertex number $τ (G)$ of a graph $G$ is the minimum number of vertices that can be deleted from $G$ such that the resultant graph does not contain a cycle. We show that…

math.CO2017★ 4 cited

On the maximum value of conflict-free verex-connection number of graphs

Zhenzhen Li, Baoyindureng Wu

A path in a vertex-colored graph is called {\it conflict-free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be {\it conflict-free vert…

math.CO2017★ 1 cited

A note on edge degree and spanning trail containing given edges

Weihua Yang, Hong-jian Lai, Baoyindureng Wu

Let $G$ be a simple graph with $n \geq 4$ vertices and $d (x) + d (y) \geq n + k$ for each edge $x y \in E (G)$ . In this work we prove that $G$ either contains a spanning closed trail containi…

math.CO2017

Independent transversal domination number of a graph

Hongting Wang, Baoyindureng Wu, Xinhui An

Let $G = (V, E)$ be a graph. A set $S \subseteq V (G)$ is a {\it dominating set} of $G$ if every vertex in $V ∖ S$ is adjacent to a vertex of $S$ . The {\it domination number} of…