Yaping Mao

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 81

Top Topics

Bipartite Graph

Grow Exponentially

Top Venues

Discret. Appl. Math.

J. Interconnect. Networks

Publications

Sainan Guo, Yannan Chen, Yaping Mao, Xiaoyan Zhang
Online Single-Processor Scheduling with an Unexpected Breakdown. Asia Pac. J. Oper. Res. 41 (1) (2024)
Xiaojuan Zhang, Gang Yang, Changxiang He, Ralf Klasing, Yaping Mao
The number of spanning trees for Sierpiński graphs and data center networks. Inf. Comput. 300 (2024)
Eddie Cheng, Longkun Guo, Yaping Mao, Xiaoyan Zhang
A Commentary on the Progress of Big Data in Combinatorial Optimization. Parallel Process. Lett. 34 (1) (2024)
Gang Yang, Jiannan Zhou, Changxiang He, Yaping Mao
Distance-edge-monitoring sets of networks. Acta Informatica 61 (2) (2024)
Yaping Mao
Gallai-Ramsey Multiplicity. Graphs Comb. 40 (3) (2024)
Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang
Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret. Appl. Math. 342 (2024)
Chenxu Yang, Gang Yang, Sun-Yuan Hsieh, Yaping Mao, Ralf Klasing
Monitoring the edges of a graph using distances with given girth. J. Comput. Syst. Sci. 143 (2024)
Zhiqiang Ma, Yaping Mao, Ingo Schiermeyer, Meiqin Wei
Complete bipartite graphs without small rainbow subgraphs. Discret. Appl. Math. 346 (2024)
Chenxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng
On the distance-edge-monitoring numbers of graphs. Discret. Appl. Math. 342 (2024)
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao
The g-extra connectivity of graph products. J. Comput. Syst. Sci. 145 (2024)
Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao
Perturbation Results for Distance-edge-monitoring Numbers. Fundam. Informaticae 191 (2) (2024)
Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. J. Comb. Theory, Ser. A 193 (2023)
Yaping Mao
Size Gallai-Ramsey Number. Graphs Comb. 39 (6) (2023)
Hengzhe Li, Huayue Liu, Jianbing Liu, Yaping Mao
Edge-Disjoint Steiner Trees and Connectors in Graphs. Graphs Comb. 39 (2) (2023)
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Gallai-Ramsey numbers for fans. Discret. Math. 346 (5) (2023)
Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing
Constructing disjoint Steiner trees in Sierpiński graphs. CoRR (2023)
Wenqi Wang, Gregory Z. Gutin, Yaping Mao, Donglei Du, Xiaoyan Zhang
Streaming Algorithms for the k-Submodular Cover Problem. CoRR (2023)
Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao
Gallai-Ramsey Numbers Involving a Rainbow 4-Path. Graphs Comb. 39 (3) (2023)
Guowei Dai, Yannan Chen, Yaping Mao, Dachuan Xu, Xiaoyan Zhang, Zan-Bo Zhang
A distributed message passing algorithm for computing perfect demand matching. J. Parallel Distributed Comput. 179 (2023)
Jiannan Zhou, Zhihui Li, Yaping Mao, Meiqin Wei
Ramsey and Gallai-Ramsey numbers for the union of paths and stars. Discret. Appl. Math. 325 (2023)
Weizhen Chen, Meng Ji, Yaping Mao, Meiqin Wei
Complete bipartite graphs without small rainbow stars. Discret. Appl. Math. 340 (2023)
Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao
Perturbation results for distance-edge-monitoring numbers. CoRR (2023)
Wen Li, Ralf Klasing, Yaping Mao, Bo Ning
Monitoring the edges of product networks using distances. CoRR (2022)
Yaping Mao
Steiner 3-diameter, maximum degree and size of a graph. Int. J. Comput. Math. Comput. Syst. Theory 7 (2) (2022)
Tianlong Ma, Eddie Cheng, Yaping Mao, Xu Wang
A note on maximum fractional matchings of graphs. J. Comb. Optim. 43 (1) (2022)
Changxiang He, Yuru Liu, Hao Li, Hui Zhang, Yaping Mao, Xiaofei Qin, Lele Liu, Xuedian Zhang
Multi-type feature fusion based on graph neural network for drug-drug interaction prediction. BMC Bioinform. 23 (1) (2022)
Zhao Wang, Yaping Mao, Yue Li, Boris Furtula
On relations between Sombor and other degree-based indices. J. Appl. Math. Comput. 68 (1) (2022)
Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng
On the distance-edge-monitoring numbers of graphs. CoRR (2022)
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Ramsey and Gallai-Ramsey Number for Wheels. Graphs Comb. 38 (2) (2022)
Jinyu Zou, Yaping Mao, Zhao Wang, Eddie Cheng
Fractional matching preclusion number of graphs. Discret. Appl. Math. 311 (2022)
Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen
A general approach to deriving diagnosability results of interconnection networks. Int. J. Parallel Emergent Distributed Syst. 37 (4) (2022)
Meiqin Wei, Changxiang He, Yaping Mao, Xiangqian Zhou
and monochromatic fans or wheels. Discret. Math. 345 (11) (2022)
Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen
A general approach to deriving diagnosability results of interconnection networks. CoRR (2022)
Yaping Mao, Peter Dankelmann, Zhao Wang
Steiner diameter, maximum degree and size of a graph. Discret. Math. 344 (8) (2021)
Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. Discuss. Math. Graph Theory 41 (2) (2021)
Zhiwei Guo, Yaping Mao, Nan Jia, He Li
Strong Equitable Vertex Arboricity in Cartesian Product Networks. J. Interconnect. Networks 21 (2) (2021)
Yaping Mao
Preface. J. Interconnect. Networks 21 (4) (2021)
Nan Jia, Yaping Mao, Zhao Wang, Eddie Cheng
Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. Math. Comput. Sci. 15 (4) (2021)
Zhao Wang, Yaping Mao, Colton Magnant, Jinyu Zou
Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. Graphs Comb. 37 (1) (2021)
Zhao Wang, Yaping Mao, Kinkar Chandra Das, Yilun Shang
Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs. Symmetry 12 (10) (2020)
Stanislav Jendrol', Xueliang Li, Yaping Mao, Yingying Zhang, Haixing Zhao, Xiaoyu Zhu
Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40 (1) (2020)
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Jichang Wu
-good-neighbor connectivity of graphs. Theor. Comput. Sci. 804 (2020)
Colton Magnant, Yaping Mao
On Cycles that Alternate Through Selected Sets of Vertices. Graphs Comb. 36 (5) (2020)
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. Discret. Appl. Math. 285 (2020)
Tianlong Ma, Yaping Mao, Eddie Cheng, Ping Han
A note on the strong matching preclusion problem for data center networks. Inf. Process. Lett. 164 (2020)
Ran Gu, Yaping Mao, Guoju Ye
Note on matching preclusion number of random graphs. Theor. Comput. Sci. 833 (2020)
Eddie Cheng, Yaping Mao
Preface. J. Interconnect. Networks 19 (3) (2019)
Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao, Haixing Zhao
On conflict-free connection of graphs. Discret. Appl. Math. 255 (2019)
Yuzhi Xiao, Haixing Zhao, Yaping Mao, Guanrong Chen
Invulnerability of planar two-tree networks. Theor. Comput. Sci. 767 (2019)
Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang
Fractional matching preclusion for arrangement graphs. Discret. Appl. Math. 270 (2019)
Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye
Gallai-Ramsey numbers for books. Discret. Appl. Math. 268 (2019)
Zhao Wang, Yaping Mao, Eddie Cheng, Jinyu Zou
Matching preclusion number of graphs. Theor. Comput. Sci. 759 (2019)
Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng
Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. J. Inf. Sci. Eng. 35 (4) (2019)
Yaping Mao, Eddie Cheng
A Concise Survey of Matching Preclusion in Interconnection Networks. J. Interconnect. Networks 19 (3) (2019)
Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian
Fractional matching preclusion for generalized augmented cubes. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Zhao Wang, Christopher Melekian, Eddie Cheng, Yaping Mao
Matching preclusion number in product graphs. Theor. Comput. Sci. 755 (2019)
Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang
)-Star Graphs. Parallel Process. Lett. 28 (4) (2018)
Yaping Mao, Christopher Melekian, Eddie Cheng
A note on the Steiner -diameter of a graph. Int. J. Comput. Math. Comput. Syst. Theory 3 (1) (2018)
Ivan Gutman, Xueliang Li, Yaping Mao
Inverse problem on the Steiner Wiener index. Discuss. Math. Graph Theory 38 (1) (2018)
Yaping Mao, Eddie Cheng, Zhao Wang, Zhiwei Guo
The k-independence number of graph products. Art Discret. Appl. Math. 1 (1) (2018)
Yaping Mao
Constructing internally disjoint pendant Steiner trees in Cartesian product networks. Australas. J Comb. 70 (2018)
Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian
Fractional Matching Preclusion for (Burnt) Pancake Graphs. I-SPAN (2018)
Yaping Mao, Eddie Cheng, Zhao Wang
Steiner Distance in Product Networks. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye
On the Steiner 4-Diameter of Graphs. J. Interconnect. Networks 18 (1) (2018)
Yaping Mao, Zhao Wang, Eddie Cheng, Christopher Melekian
Strong matching preclusion number of graphs. Theor. Comput. Sci. 713 (2018)
Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng
Steiner Distance in Join, Corona and Threshold Graphs. ISPAN-FCST-ISCC (2017)
Yaping Mao
Constructing edge-disjoint Steiner paths in lexicographic product networks. Appl. Math. Comput. 308 (2017)
Yaping Mao, Chengfu Ye, Hengzhe Li, Shumin Zhang
(n-3, 1). Ars Comb. 135 (2017)
Yaping Mao, Zhao Wang, Ivan Gutman, He Li
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs. Discret. Appl. Math. 219 (2017)
Yuzhi Xiao, Haixing Zhao, Zhen Liu, Yaping Mao
Trees with large numbers of subtrees. Int. J. Comput. Math. 94 (2) (2017)
Zhao Wang, Yaping Mao, Chengfu Ye, Haixing Zhao
Super Edge-Connectivity of Strong Product Graphs. J. Interconnect. Networks 17 (2) (2017)
Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao
A solution to a conjecture on the generalized connectivity of graphs. J. Comb. Optim. 33 (1) (2017)
Bo Deng, Wenjing Li, Xueliang Li, Yaping Mao, Haixing Zhao
Conflict-Free Connection Numbers of Line Graphs. COCOA (1) (2017)
Ivan Gutman, Xueliang Li, Yaping Mao
The Steiner Wiener index of a graph. Discuss. Math. Graph Theory 36 (2) (2016)
Yaping Mao, Zhiwei Guo, Nan Jia, He Li
-Arboricity in Product Networks. J. Interconnect. Networks 16 (3-4) (2016)
Yaping Mao
Path-connectivity of lexicographic product graphs. Int. J. Comput. Math. 93 (1) (2016)
Yaping Mao, Zhao Wang, Fengnan Yanling, Chengfu Ye
Monochromatic connectivity and graph products. Discret. Math. Algorithms Appl. 8 (1) (2016)
Xueliang Li, Yaping Mao
Graphs with large generalized (edge-)connectivity. Discuss. Math. Graph Theory 36 (4) (2016)
Yaping Mao, Fengnan Yanling, Zhao Wang, Chengfu Ye
Rainbow vertex-connection and graph products. Int. J. Comput. Math. 93 (7) (2016)
Yaping Mao
The vertex-rainbow index of a graph. Discuss. Math. Graph Theory 36 (3) (2016)
Yaping Mao, Chengfu Ye
The fifth coefficient of adjoint polynomial and a new invariant. Ars Comb. 128 (2016)
Xueliang Li, Yaping Mao
On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. Graphs Comb. 31 (6) (2015)
Xueliang Li, Yaping Mao
The minimal size of a graph with given generalized 3-edge-connectivity. Ars Comb. 118 (2015)
Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue
Note on the spanning-tree packing number of lexicographic product graphs. Discret. Math. 338 (5) (2015)
Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li
Searching for (near) Optimal Codes. COCOA (2015)
Yaping Mao, Yongtang Shi
The complexity of determining the vertex-rainbow index of graphs. Discret. Math. Algorithms Appl. 7 (4) (2015)
Xueliang Li, Yaping Mao
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. Discret. Appl. Math. 185 (2015)
Zhiwei Guo, Haixing Zhao, Yaping Mao
The equitable vertex arboricity of complete tripartite graphs. Inf. Process. Lett. 115 (12) (2015)
Zhiwei Guo, Haixing Zhao, Yaping Mao
On the equitable vertex arboricity of complete tripartite graphs. Discret. Math. Algorithms Appl. 7 (4) (2015)
Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun
Note on the generalized connectivity. Ars Comb. 114 (2014)
Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei
Formally self-dual linear binary codes from circulant graphs. CoRR (2014)
Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei
Additive codes over $GF(4)$ from circulant graphs. CoRR (2014)
Xueliang Li, Yaping Mao
The generalized 3-connectivity of Lexicographic product graphs. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Xueliang Li, Yaping Mao, Yuefang Sun
On the generalized (edge-)connectivity of graphs. Australas. J Comb. 58 (2014)
Xueliang Li, Yaping Mao
A survey on the generalized connectivity of graphs CoRR (2012)