6 citations · 11 across the 5 of their papers we have counts for
7 papers
On the arithmetic-geometric index of graphs
Shu-Yu Cui, Weifan Wang, Gui-Xian Tian +1
Very recently, the first geometric-arithmetic index and arithmetic-geometric index were introduced in mathematical chemistry. In the present paper, we first obtain some l…
Feedback vertex number of Sierpiński-type graphs
LiLi Yuan, Baoyindureng Wu, Biao Zhao
The feedback vertex number of a graph is the minimum number of vertices that can be deleted from such that the resultant graph does not contain a cycle. We show that…
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…
A note on edge degree and spanning trail containing given edges
Weihua Yang, Hong-jian Lai, Baoyindureng Wu
Let be a simple graph with vertices and for each edge . In this work we prove that either contains a spanning closed trail containi…
Two-log-convexity of the Catalan-Larcombe-French sequence
Brian Yi Sun, Baoyindureng Wu
The Catalan-Larcombe-French sequence arises in a series expansion of the complete elliptic integral of the first kind. It has been proved that the sequence is l…
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 -forcing number of graph for a positive integer as the generalization of the zero forcing num…