Baoyindureng Wu

activity

20092025

most citedEigenvalues and triangles in graphs

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

collaborators

20 papers

math.CO2025

Odd spanning trees of a graph

Jingyu Zheng, Baoyindureng Wu

A graph $G = (V, E)$ is said to be odd (or even, resp.) if $d_{G} (v)$ is odd (or even, resp.) for any $v \in V$ . Trivially, the order of an odd graph must be even. In this paper, we show…

math.CO2023

Gallai's path decomposition conjecture for cartesian product of graphs (\uppercase\expandafter{\romannumeral 2})

Xiaohong Chen, Baoyindureng Wu

Let $G$ be a graph of order $n$ . A path decomposition $P$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$ . Let $p (G)$ denote the minimum nu…

math.CO2023

Gallai's path decomposition conjecture for Cartesian product of graphs

Xiaohong Chen, Baoyindureng Wu

Let $G$ be a graph of order $n$ . A path decomposition $P$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$ . Let $p (G)$ denote the minimum nu…

math.CO2022

Maximum odd induced subgraph of a graph concerning its chromatic number

Tao Wang, Baoyindureng Wu

Let $f_{o} (G)$ be the maximum order of an odd induced subgraph of $G$ . In 1992, Scott proposed a conjecture that $f_{o} (G) \geq \frac{n}{2 χ ( G )}$ for a graph $G$ of order $n$ witho…

math.CO2020★ 11 cited

On the arithmetic-geometric index of graphs

Shu-Yu Cui, Weifan Wang, Gui-Xian Tian +1

Very recently, the first geometric-arithmetic index $G A$ and arithmetic-geometric index $A G$ were introduced in mathematical chemistry. In the present paper, we first obtain some l…

math.CO2019★ 84 cited

Eigenvalues and triangles in graphs

Huiqiu Lin, Bo Ning, Baoyindureng Wu

Bollobás and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r + 1}$ -free graph on at least $r + 1$ vertices and $m$ edges, then $λ…

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…

math.CO2016

A $P_{3}$ -decomposition of tournaments and bipartite digraphs

Fangxia Wang, Baoyindureng Wu, Xinhui An

A $P_{3}$ -decomposition of a directed graph $D$ is a partition of the arcs of $D$ into directed paths of length $2$ . In this paper, we give a characterization for…

math.CO2016★ 1 cited

Two-log-convexity of the Catalan-Larcombe-French sequence

Brian Yi Sun, Baoyindureng Wu

The Catalan-Larcombe-French sequence ${P_{n}}_{n \geq 0}$ arises in a series expansion of the complete elliptic integral of the first kind. It has been proved that the sequence is l…

math.CO2016

Construction and characterization of graphs whose each spanning tree has a perfect matching

Baoyindureng Wu, Heping Zhang

An edge subset $S$ of a connected graph $G$ is called an anti-Kekulé set if $G - S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekulé…

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$ …

math.CO2014

Connected even factors in the square of essentially 2-edge connected graphs

Jan Ekstein, Baoyindureng Wu, Liming Xiong

In this paper we prove that the square of an essentially 2-edge connected graph with an additional property has a connected even factor with maximum degree at most 4. Moreover we s…

math.CO2009

On Reichenbach's causal betweenness

Vasek Chvatal, Baoyindureng Wu

We characterize, by easily verifiable properties, abstract ternary relations isomorphic to the causal betweenness introduced by Hans Reichenbach.