Baoyindureng Wu

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 67

Top Venues

Publications

Gang Zhang, Baoyindureng Wu
On the cycle isolation number of triangle-free graphs. Discret. Math. 347 (12) (2024)
Bo Zhang, Baoyindureng Wu
Graphs G Where G-N[v] is a Tree for Each Vertex v. Graphs Comb. 40 (4) (2024)
Fangxia Wang, Baoyindureng Wu
The k-Sombor Index of Trees. Asia Pac. J. Oper. Res. 41 (1) (2024)
Wei Yang, Baoyindureng Wu
Outer connected domination in maximal outerplanar graphs and beyond. Discuss. Math. Graph Theory 44 (2) (2024)
Gang Zhang, Baoyindureng Wu
Cycle Isolation of Graphs with Small Girth. Graphs Comb. 40 (2) (2024)
Gang Zhang, Baoyindureng Wu
k-isolation in graphs. Discret. Appl. Math. 357 (2024)
Bo Zhang, Baoyindureng Wu
Graphs G where G-N[v] is a regular graph for each vertex v. Comput. Appl. Math. 43 (5) (2024)
Shuting Cheng, Baoyindureng Wu
The first general Zagreb index of graphs and their line graphs. J. Appl. Math. Comput. 70 (3) (2024)
Wei Yang, Baoyindureng Wu
Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two. Discret. Math. 347 (10) (2024)
Yanfang Liang, Baoyindureng Wu
On some conjectures on biclique graphs. Discret. Appl. Math. 343 (2024)
Tao Wang, Baoyindureng Wu, Taishan Wang
Harmonic index of a line graph. Discret. Appl. Math. 325 (2023)
Tongtong Xu, Baoyindureng Wu
Weak saturation number of a complete bipartite graph. Appl. Math. Comput. 455 (2023)
Wei Yang, Baoyindureng Wu
On packing S-colorings of subcubic graphs. Discret. Appl. Math. 334 (2023)
Jiawei Meng, Baoyindureng Wu, Hongliang Ma
On Several Parameters of Super Line Graph L2(G). Axioms 12 (3) (2023)
Tao Wang, Baoyindureng Wu
Induced subgraphs of a tree with constraint degree. Appl. Math. Comput. 440 (2023)
Wei Yang, Baoyindureng Wu
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs. Discret. Appl. Math. 324 (2023)
Wei Yang, Baoyindureng Wu
Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two. Graphs Comb. 39 (5) (2023)
Zhenzhen Li, Baoyindureng Wu
Conflict-Free Connection Number of Graphs with Four Bridges. Graphs Comb. 39 (3) (2023)
Tao Wang, Baoyindureng Wu
The size of graphs with given feedback vertex number. Discret. Appl. Math. 314 (2022)
Wei Yang, Baoyindureng Wu
Broadcast Domination in Subcubic Graphs. Graphs Comb. 38 (6) (2022)
Lingmei Liang, Fengxia Liu, Baoyindureng Wu
-hued coloring of product graphs. RAIRO Oper. Res. 56 (6) (2022)
Huijuan Yu, Baoyindureng Wu
Admissible Property of Graphs in Terms of Radius. Graphs Comb. 38 (1) (2022)
Xiang Qin, Baoyindureng Wu
Decomposition of graphs with constraint on minimum degree. Discret. Appl. Math. 321 (2022)
Xiaohong Chen, Baoyindureng Wu
Domination number and feedback vertex number of complements of line graphs. AKCE Int. J. Graphs Comb. 19 (3) (2022)
Wei Yang, Baoyindureng Wu
Injective Edge-Coloring of Graphs with Small Weight. Graphs Comb. 38 (6) (2022)
Jiangfu Zhang, Baoyindureng Wu
Randić Index of a Line Graph. Axioms 11 (5) (2022)
Wanping Zhang, Jixiang Meng, Baoyindureng Wu
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees. J. Comb. Optim. 44 (2) (2022)
Wei Yang, Baoyindureng Wu
On S-packing edge-colorings of graphs with small edge weight. Appl. Math. Comput. 418 (2022)
Wei Yang, Baoyindureng Wu
Disproofs of three conjectures on the power domination of graphs. Discret. Appl. Math. 307 (2022)
Fengxia Liu, Baoyindureng Wu, Jixiang Meng
-free graphs. Discuss. Math. Graph Theory 42 (2) (2022)
Bo Zhang, Baoyindureng Wu
Graphs G in which G-N[v] has a prescribed property for each vertex v. Discret. Appl. Math. 318 (2022)
Zhenzhen Li, Baoyindureng Wu
Proper-walk connection of hamiltonian digraphs. Appl. Math. Comput. 427 (2022)
Wanping Zhang, Jixiang Meng, Baoyindureng Wu
Extremal graphs with respect to two distance-based topological indices. Discret. Appl. Math. 317 (2022)
Huiqiu Lin, Bo Ning, Baoyindureng Wu
Eigenvalues and triangles in graphs. Comb. Probab. Comput. 30 (2) (2021)
Zhonghua Li, Baoyindureng Wu
The k-independence number of t-connected graphs. Appl. Math. Comput. 409 (2021)
Gang Zhang, Baoyindureng Wu
K1, 2-isolation in graphs. Discret. Appl. Math. 304 (2021)
Huijuan Yu, Baoyindureng Wu
. Discret. Math. 344 (9) (2021)
Xiang Qin, Yanhua Zhao, Baoyindureng Wu
Wiener Index of k-Connected Graphs. J. Interconnect. Networks 21 (4) (2021)
Wei Yang, Baoyindureng Wu
Proof of a conjecture on the strong chromatic index of Halin graphs. Discret. Appl. Math. 302 (2021)
Baoyindureng Wu, Heping Zhang
Graphs where each spanning tree has a perfect matching. Contributions Discret. Math. 16 (3) (2021)
Bo Zhang, Baoyindureng Wu
Anti-Eulerian digraphs. Appl. Math. Comput. 411 (2021)
Fangxia Wang, Baoyindureng Wu
Disproofs of two conjectures on no hole anti-n-labeling of graphs. Discret. Appl. Math. 300 (2021)
Miaomiao Zhuo, Qinqin Li, Baoyindureng Wu, Xinhui An
Average Edge-Connectivity of Cubic Graphs. J. Interconnect. Networks 21 (4) (2021)
Hengzhe Li, Yuanyuan Lu, Baoyindureng Wu, Ankang Wei
The κk-connectivity of line graphs. Discret. Appl. Math. 285 (2020)
Lili Yuan, Baoyindureng Wu, Biao Zhao
Feedback vertex number of Sierpiński-type graphs. Contributions Discret. Math. 14 (1) (2019)
Yin Chen, Baoyindureng Wu
On the geometric-arithmetic index of a graph. Discret. Appl. Math. 254 (2019)
Hengzhe Li, Baoyindureng Wu, Weihua Yang
Making a dominating set of a graph connected. Discuss. Math. Graph Theory 38 (4) (2018)
Xiaoling Ma, Baoyindureng Wu, Xian'an Jin
Edge-disjoint spanning trees and the number of maximum state circles of a graph. J. Comb. Optim. 35 (4) (2018)
Fengxia Liu, Baoyindureng Wu, Jixiang Meng
Partitioning the Cartesian product of a tree and a cycle. Appl. Math. Comput. 332 (2018)
Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma
Steiner tree packing number and tree connectivity. Discret. Math. 341 (7) (2018)
Zhenzhen Li, Baoyindureng Wu
Maximum value of conflict-free vertex-connection number of graphs. Discret. Math. Algorithms Appl. 10 (5) (2018)
Zixuan Yang, Baoyindureng Wu
Strong edge chromatic index of the generalized Petersen graphs. Appl. Math. Comput. 321 (2018)
Huiqiu Lin, Jinlong Shu, Baoyindureng Wu
Nordhaus-Gaddum type result for the matching number of a graph. J. Comb. Optim. 34 (3) (2017)
Zixing Tang, Baoyindureng Wu, Lin Hu, Manouchehr Zaker
More bounds for the Grundy number of graphs. J. Comb. Optim. 33 (2) (2017)
Jan Ekstein, Baoyindureng Wu, Liming Xiong
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. Electron. J. Comb. 24 (3) (2017)
Xiao Wang, Baoyindureng Wu
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree. J. Comb. Optim. 33 (1) (2017)
Fangxia Wang, Baoyindureng Wu, Xinhui An
A -decomposition of tournaments and bipartite digraphs. Discret. Appl. Math. 226 (2017)
Baoyindureng Wu, Clive Elphick
Upper bounds for the achromatic and coloring numbers of a graph. Discret. Appl. Math. 217 (2017)
Wei Yang, Xinhui An, Baoyindureng Wu
Paired-domination number of claw-free odd-regular graphs. J. Comb. Optim. 33 (4) (2017)
Leihao Lu, Baoyindureng Wu, Zixing Tang
Proof of a conjecture on the zero forcing number of a graph. Discret. Appl. Math. 213 (2016)
Huiqiu Lin, Jinlong Shu, Baoyindureng Wu
Maximum size of digraphs with some parameters. J. Comb. Optim. 32 (3) (2016)
Huiqiu Lin, Kinkar Chandra Das, Baoyindureng Wu
Remoteness and distance eigenvalues of a graph. Discret. Appl. Math. 215 (2016)
Hengzhe Li, Yuxing Yang, Baoyindureng Wu
2-Edge connected dominating sets and 2-Connected dominating sets of a graph. J. Comb. Optim. 31 (2) (2016)
Wei Wang, Baoyindureng Wu, Zhidan Yan, Nini Xue
A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs. Graphs Comb. 31 (5) (2015)
Fenling Xu, Baoyindureng Wu, Qinqin Li
}-free 4-regular graph. Discret. Math. 338 (7) (2015)
Yang Zhao, Baoyindureng Wu
Star decomposition of graphs. Discret. Math. Algorithms Appl. 7 (2) (2015)
Tingting Zhu, Baoyindureng Wu
-minor free graphs, and disproofs of two conjectures on planar graphs. Discret. Appl. Math. 194 (2015)
Xiaoping Liu, Zhilan Dang, Baoyindureng Wu
The hub number, girth and Mycielski graphs. Inf. Process. Lett. 114 (10) (2014)
Baoyindureng Wu, Wanping Zhang
Average distance, radius and remoteness of a graph. Ars Math. Contemp. 7 (2) (2014)
Shipeng Wang, Baoyindureng Wu, Xinhui An, Xiaoping Liu, Xingchao Deng
Outer-connected domination in 2-connected cubic graphs. Discret. Math. Algorithms Appl. 6 (3) (2014)
Baoyindureng Wu, Juan Yan, Xiaojing Yang
Randić index and coloring number of a graph. Discret. Appl. Math. 178 (2014)
Baoyindureng Wu, Xinhui An
Disproof of the group coloring version of the Hadwiger conjecture. Discret. Math. Algorithms Appl. 6 (3) (2014)
Xiaojing Yang, Baoyindureng Wu
[1, 2]-domination in graphs. Discret. Appl. Math. 175 (2014)
Lingyan Zhen, Baoyindureng Wu
. Ars Comb. 108 (2013)
Baoyindureng Wu, Xinhui An, Guojie Liu, Guiying Yan, Xiaoping Liu
Minimum degree, edge-connectivity and radius. J. Comb. Optim. 26 (3) (2013)
Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan
A Note on Semi-coloring of Graphs. Graphs Comb. 29 (4) (2013)
Beibei Ma, Baoyindureng Wu, Wanping Zhang
Proximity and average eccentricity of a graph. Inf. Process. Lett. 112 (10) (2012)
Nini Xue, Baoyindureng Wu
List Point Arboricity of Graphs. Discret. Math. Algorithms Appl. 4 (2) (2012)
Xingchao Deng, Kai-Nan Xiang, Baoyindureng Wu
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. Appl. Math. Lett. 25 (3) (2012)
Weijuan Zhang, Baoyindureng Wu, Xinhui An
The Hyper-Wiener Index of the kth Power of a Graph. Discret. Math. Algorithms Appl. 3 (1) (2011)
Yun Wang, Baoyindureng Wu
Proof of a conjecture on connectivity of Kronecker product of graphs. Discret. Math. 311 (21) (2011)
Zhihua An, Baoyindureng Wu, Daobin Li, Yun Wang, Guifu Su
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts. Discret. Math. Algorithms Appl. 3 (3) (2011)
Fang Duan, Baoyindureng Wu
On chromatic number of graphs without certain induced subgraphs. Ars Comb. 101 (2011)
Daobin Li, Baoyindureng Wu, Xunuan Yang, Xinhui An
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts. Discret. Appl. Math. 159 (15) (2011)
Baoyindureng Wu, Guojie Liu, Xinhui An, Guiying Yan, Xiaoping Liu
A Conjecture on Average Distance and Diameter of a Graph. Discret. Math. Algorithms Appl. 3 (3) (2011)
Xunuan Yang, Baoyindureng Wu, Guiying Yan
On the Sum of Independence Number and Average Degree of a Graph. Discret. Math. Algorithms Appl. 3 (2) (2011)
Xinhui An, Baoyindureng Wu
HajóS-like Theorem for Group Coloring. Discret. Math. Algorithms Appl. 2 (3) (2010)
Ehsan Chiniforooshan, Baoyindureng Wu
Maximum values of Szeged index and edge-Szeged index of graphs. Electron. Notes Discret. Math. 34 (2009)
Xiaoping Liu, Xinhui An, Baoyindureng Wu
On perfect matchings of complements of line graphs. Ars Comb. 90 (2009)
Lingyan Zhen, Baoyindureng Wu
List Point Arboricity of Dense Graphs. Graphs Comb. 25 (1) (2009)
Lei Yi, Baoyindureng Wu
. Australas. J Comb. 44 (2009)
Xinhui An, Baoyindureng Wu
List linear arboricity of planar graphs. Discuss. Math. Graph Theory 29 (3) (2009)
Baoyindureng Wu, Xinhui An
A Note on Edge Choosability and Degeneracy of Planar Graphs. COCOA (2009)
Lan Xu, Baoyindureng Wu
. Discret. Math. 308 (22) (2008)
Baoyindureng Wu, Li Zhang
Disproof of a Conjecture on List Coloring. Ars Comb. 89 (2008)
Xinhui An, Baoyindureng Wu
The Wiener index of the kth power of a graph. Appl. Math. Lett. 21 (5) (2008)
Baoyindureng Wu, Li Zhang
(G)=4 is 11. Discret. Math. 308 (23) (2008)
Baoyindureng Wu, Xiaoping Liu, Xiaofeng Guo
Super-connected and hyper-connected jump graphs. Int. J. Comput. Math. 85 (12) (2008)
Xinhui An, Baoyindureng Wu
Hamiltonicity of complements of middle graphs. Discret. Math. 307 (9-10) (2007)
Li Zhang, Baoyindureng Wu
A note on the cover degeneracy of graphs. J. Graph Theory 51 (2) (2006)

Baoyindureng Wu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Baoyindureng Wu