A survey on the generalized connectivity of graphs - Xueliang Li 001; Yaping Mao (CoRR, 2012)

On the generalized (edge-)connectivity of graphs. - Xueliang Li 001; Yaping Mao; Yuefang Sun (Australas. J Comb., 2014)

Note on the generalized connectivity. - Hengzhe Li; Xueliang Li 001; Yaping Mao; Yuefang Sun (Ars Comb., 2014)

Formally self-dual linear binary codes from circulant graphs. - Ruihu Li; Xueliang Li 001; Yaping Mao; Meiqin Wei (CoRR, 2014)

Additive codes over $GF(4)$ from circulant graphs. - Ruihu Li; Xueliang Li 001; Yaping Mao; Meiqin Wei (CoRR, 2014)

The generalized 3-connectivity of Lexicographic product graphs. - Xueliang Li 001; Yaping Mao (Discret. Math. Theor. Comput. Sci., 2014)

Searching for (near) Optimal Codes. - Xueliang Li 001; Yaping Mao; Meiqin Wei; Ruihu Li (COCOA, 2015)

The minimal size of a graph with given generalized 3-edge-connectivity. - Xueliang Li 001; Yaping Mao (Ars Comb., 2015)

Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. - Xueliang Li 001; Yaping Mao (Discret. Appl. Math., 2015)

Note on the spanning-tree packing number of lexicographic product graphs. - Hengzhe Li; Xueliang Li 001; Yaping Mao; Jun Yue (Discret. Math., 2015)

On the equitable vertex arboricity of complete tripartite graphs. - Zhiwei Guo; Haixing Zhao; Yaping Mao (Discret. Math. Algorithms Appl., 2015)

The complexity of determining the vertex-rainbow index of graphs. - Yaping Mao; Yongtang Shi (Discret. Math. Algorithms Appl., 2015)

On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. - Xueliang Li 001; Yaping Mao (Graphs Comb., 2015)

The fifth coefficient of adjoint polynomial and a new invariant. - Yaping Mao; Chengfu Ye (Ars Comb., 2016)

Monochromatic connectivity and graph products. - Yaping Mao; Zhao Wang 007; Fengnan Yanling; Chengfu Ye (Discret. Math. Algorithms Appl., 2016)

The Steiner Wiener index of a graph. - Ivan Gutman; Xueliang Li 001; Yaping Mao (Discuss. Math. Graph Theory, 2016)

Graphs with large generalized (edge-)connectivity. - Xueliang Li 001; Yaping Mao (Discuss. Math. Graph Theory, 2016)

The vertex-rainbow index of a graph. - Yaping Mao (Discuss. Math. Graph Theory, 2016)

Path-connectivity of lexicographic product graphs. - Yaping Mao (Int. J. Comput. Math., 2016)

Rainbow vertex-connection and graph products. - Yaping Mao; Fengnan Yanling; Zhao Wang 007; Chengfu Ye (Int. J. Comput. Math., 2016)

Linear k-Arboricity in Product Networks. - Yaping Mao; Zhiwei Guo; Nan Jia; He Li (J. Interconnect. Networks, 2016)

Conflict-Free Connection Numbers of Line Graphs. - Bo Deng; Wenjing Li; Xueliang Li 001; Yaping Mao; Haixing Zhao (COCOA (1), 2017)

Steiner Distance in Join, Corona and Threshold Graphs. - Zhao Wang 007; Yaping Mao; Christopher Melekian; Eddie Cheng 001 (ISPAN-FCST-ISCC, 2017)

Constructing edge-disjoint Steiner paths in lexicographic product networks. - Yaping Mao (Appl. Math. Comput., 2017)

The chromatic equivalence class of graph ψn3(n-3, 1). - Yaping Mao; Chengfu Ye; Hengzhe Li; Shumin Zhang (Ars Comb., 2017)

Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs. - Yaping Mao; Zhao Wang 007; Ivan Gutman; He Li (Discret. Appl. Math., 2017)

Trees with large numbers of subtrees. - Yuzhi Xiao; Haixing Zhao; Zhen Liu; Yaping Mao (Int. J. Comput. Math., 2017)

A solution to a conjecture on the generalized connectivity of graphs. - Lily Chen; Xueliang Li 001; Mengmeng Liu; Yaping Mao (J. Comb. Optim., 2017)

Super Edge-Connectivity of Strong Product Graphs. - Zhao Wang 007; Yaping Mao; Chengfu Ye; Haixing Zhao (J. Interconnect. Networks, 2017)

Fractional Matching Preclusion for (Burnt) Pancake Graphs. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Christopher Melekian (I-SPAN, 2018)

The k-independence number of graph products. - Yaping Mao; Eddie Cheng 001; Zhao Wang 007; Zhiwei Guo (Art Discret. Appl. Math., 2018)

Constructing internally disjoint pendant Steiner trees in Cartesian product networks. - Yaping Mao (Australas. J Comb., 2018)

Inverse problem on the Steiner Wiener index. - Ivan Gutman; Xueliang Li 001; Yaping Mao (Discuss. Math. Graph Theory, 2018)

Steiner Distance in Product Networks. - Yaping Mao; Eddie Cheng 001; Zhao Wang 007 (Discret. Math. Theor. Comput. Sci., 2018)

A note on the Steiner -diameter of a graph. - Yaping Mao; Christopher Melekian; Eddie Cheng 001 (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

On the Steiner 4-Diameter of Graphs. - Zhao Wang 007; Yaping Mao; Hengzhe Li; Chengfu Ye (J. Interconnect. Networks, 2018)

Fractional Matching Preclusion for (n, k)-Star Graphs. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Jinling Wang 002 (Parallel Process. Lett., 2018)

Strong matching preclusion number of graphs. - Yaping Mao; Zhao Wang 007; Eddie Cheng 001; Christopher Melekian (Theor. Comput. Sci., 2018)

On conflict-free connection of graphs. - Hong Chang 002; Zhong Huang; Xueliang Li 001; Yaping Mao; Haixing Zhao (Discret. Appl. Math., 2019)

Fractional matching preclusion for arrangement graphs. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Jinling Wang 002 (Discret. Appl. Math., 2019)

Gallai-Ramsey numbers for books. - Jinyu Zou; Yaping Mao; Colton Magnant; Zhao Wang 007; Chengfu Ye (Discret. Appl. Math., 2019)

Fractional matching preclusion for generalized augmented cubes. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Christopher Melekian (Discret. Math. Theor. Comput. Sci., 2019)

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. - Zhao Wang 007; Yaping Mao; Christopher Melekian; Eddie Cheng 001 (J. Inf. Sci. Eng., 2019)

Preface. - Eddie Cheng 001; Yaping Mao (J. Interconnect. Networks, 2019)

A Concise Survey of Matching Preclusion in Interconnection Networks. - Yaping Mao; Eddie Cheng 001 (J. Interconnect. Networks, 2019)

Matching preclusion number in product graphs. - Zhao Wang 007; Christopher Melekian; Eddie Cheng 001; Yaping Mao (Theor. Comput. Sci., 2019)

Matching preclusion number of graphs. - Zhao Wang 007; Yaping Mao; Eddie Cheng 001; Jinyu Zou (Theor. Comput. Sci., 2019)

Invulnerability of planar two-tree networks. - Yuzhi Xiao; Haixing Zhao; Yaping Mao; Guanrong Chen (Theor. Comput. Sci., 2019)

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Discret. Appl. Math., 2020)

Conflict-free vertex-connections of graphs. - Stanislav Jendrol'; Xueliang Li 001; Yaping Mao; Yingying Zhang; Haixing Zhao; Xiaoyu Zhu (Discuss. Math. Graph Theory, 2020)

On Cycles that Alternate Through Selected Sets of Vertices. - Colton Magnant; Yaping Mao (Graphs Comb., 2020)

A note on the strong matching preclusion problem for data center networks. - Tianlong Ma; Yaping Mao; Eddie Cheng 001; Ping Han (Inf. Process. Lett., 2020)

Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs. - Zhao Wang 007; Yaping Mao; Kinkar Chandra Das; Yilun Shang (Symmetry, 2020)

Note on matching preclusion number of random graphs. - Ran Gu; Yaping Mao; Guoju Ye (Theor. Comput. Sci., 2020)

On the g-good-neighbor connectivity of graphs. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Jichang Wu (Theor. Comput. Sci., 2020)

Steiner diameter, maximum degree and size of a graph. - Yaping Mao; Peter Dankelmann; Zhao Wang 007 (Discret. Math., 2021)

Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. - Hajo Broersma; Qin Ma; Yaping Mao; Jichang Wu (Discuss. Math. Graph Theory, 2021)

Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. - Zhao Wang 007; Yaping Mao; Colton Magnant; Jinyu Zou (Graphs Comb., 2021)

Strong Equitable Vertex Arboricity in Cartesian Product Networks. - Zhiwei Guo; Yaping Mao; Nan Jia; He Li (J. Interconnect. Networks, 2021)

Preface. - Yaping Mao (J. Interconnect. Networks, 2021)

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. - Nan Jia; Yaping Mao; Zhao Wang 007; Eddie Cheng 001 (Math. Comput. Sci., 2021)

Multi-type feature fusion based on graph neural network for drug-drug interaction prediction. - Changxiang He; Yuru Liu; Hao Li; Hui Zhang; Yaping Mao; Xiaofei Qin; Lele Liu; Xuedian Zhang (BMC Bioinform., 2022)

On the distance-edge-monitoring numbers of graphs. - Chengxu Yang; Ralf Klasing; Yaping Mao; Xingchao Deng (CoRR, 2022)

Fractional matching preclusion number of graphs. - Jinyu Zou; Yaping Mao; Zhao Wang 007; Eddie Cheng 001 (Discret. Appl. Math., 2022)

Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. - Meiqin Wei; Changxiang He; Yaping Mao; Xiangqian Zhou (Discret. Math., 2022)

Ramsey and Gallai-Ramsey Number for Wheels. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Graphs Comb., 2022)

Steiner 3-diameter, maximum degree and size of a graph. - Yaping Mao (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

A note on maximum fractional matchings of graphs. - Tianlong Ma; Eddie Cheng 001; Yaping Mao; Xu Wang (J. Comb. Optim., 2022)

A general approach to deriving diagnosability results of interconnection networks. - Eddie Cheng 001; Yaping Mao; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2022)

On relations between Sombor and other degree-based indices. - Zhao Wang 007; Yaping Mao; Yue Li; Boris Furtula (J. Appl. Math. Comput., 2022)

Constructing disjoint Steiner trees in Sierpiński graphs. - Chenxu Yang; Ping Li 025; Yaping Mao; Eddie Cheng 001; Ralf Klasing (CoRR, 2023)

Streaming Algorithms for the k-Submodular Cover Problem. - Wenqi Wang; Gregory Z. Gutin; Yaping Mao; Donglei Du; Xiaoyan Zhang 001 (CoRR, 2023)

Ramsey and Gallai-Ramsey numbers for the union of paths and stars. - Jiannan Zhou; Zhihui Li; Yaping Mao; Meiqin Wei (Discret. Appl. Math., 2023)

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. - Yaping Mao; Kenta Ozeki; Aaron Robertson; Zhao Wang 007 (J. Comb. Theory A, 2023)

Edge-Disjoint Steiner Trees and Connectors in Graphs. - Hengzhe Li; Huayue Liu; Jianbing Liu; Yaping Mao (Graphs Comb., 2023)

Gallai-Ramsey numbers for fans. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Discret. Math., 2023)

Gallai-Ramsey Numbers Involving a Rainbow 4-Path. - Jinyu Zou; Zhao Wang 007; Hong-Jian Lai; Yaping Mao (Graphs Comb., 2023)

A distributed message passing algorithm for computing perfect demand matching. - Guowei Dai; Yannan Chen; Yaping Mao; Dachuan Xu; Xiaoyan Zhang 001; Zan-Bo Zhang (J. Parallel Distributed Comput., 2023)

Complete bipartite graphs without small rainbow stars. - Weizhen Chen; Meng Ji; Yaping Mao; Meiqin Wei (Discret. Appl. Math., 2023)

Size Gallai-Ramsey Number. - Yaping Mao (Graphs Comb., 2023)

A Distributed Approximation Algorithm for the Total Dominating Set Problem. - Limin Wang; Zhao Zhang 002; Donglei Du; Yaping Mao; Xiaoyan Zhang 001 (AAIM (1), 2024)

Complete bipartite graphs without small rainbow subgraphs. - Zhiqiang Ma; Yaping Mao; Ingo Schiermeyer; Meiqin Wei (Discret. Appl. Math., 2024)

Perturbation Results for Distance-edge-monitoring Numbers. - Chenxu Yang; Ralf Klasing; Changxiang He; Yaping Mao (Fundam. Informaticae, 2024)

The number of spanning trees for Sierpiński graphs and data center networks. - Xiaojuan Zhang; Gang Yang; Changxiang He; Ralf Klasing; Yaping Mao (Inf. Comput., 2024)

The g-extra connectivity of graph products. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing; Yuzhi Xiao (J. Comput. Syst. Sci., 2024)

Monitoring the edges of a graph using distances with given girth. - Chenxu Yang; Gang Yang; Sun-Yuan Hsieh; Yaping Mao; Ralf Klasing (J. Comput. Syst. Sci., 2024)

Realizability problem of distance-edge-monitoring numbers. - Zhen Ji; Yaping Mao; Eddie Cheng 001; Xiaoyan Zhang 001 (RAIRO Oper. Res., 2024)

Erdös-Gallai-type problems for distance-edge-monitoring numbers. - Zhen Ji; Ralf Klasing; Wen Li; Yaping Mao; Xiaoyan Zhang 001 (Discret. Appl. Math., 2024)

On the distance-edge-monitoring numbers of graphs. - Chenxu Yang; Ralf Klasing; Yaping Mao; Xingchao Deng (Discret. Appl. Math., 2024)

Online Single-Processor Scheduling with an Unexpected Breakdown. - Sainan Guo; Yannan Chen; Yaping Mao; Xiaoyan Zhang 001 (Asia Pac. J. Oper. Res., 2024)

A Commentary on the Progress of Big Data in Combinatorial Optimization. - Eddie Cheng 001; Longkun Guo; Yaping Mao; Xiaoyan Zhang 001 (Parallel Process. Lett., 2024)

Gallai-Ramsey Multiplicity. - Yaping Mao (Graphs Comb., 2024)

Distance-edge-monitoring sets of networks. - Gang Yang; Jiannan Zhou; Changxiang He; Yaping Mao (Acta Informatica, 2024)

Gallai-Ramsey Numbers for Paths. - Ping Li 025; Yaping Mao; Ingo Schiermeyer; Yifan Yao (Graphs Comb., 2024)

The distance-edge-monitoring numbers of subdivision graphs. - Zhen Ji; Zhiwei Guo; Eddie Cheng 001; Ralf Klasing; Yaping Mao (Discret. Appl. Math., 2025)

Ordered Gallai-Ramsey numbers. - Yaping Mao (Discret. Appl. Math., 2025)

Multicolor induced Ramsey numbers. - Yanyan Song; Yaping Mao (Discret. Appl. Math., 2025)

Ramsey and Gallai-Ramsey numbers for comb and sun graphs. - Xiao Xu; Meiqin Wei; Hong-Jian Lai; Yaping Mao (Discret. Appl. Math., 2025)

Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities. - Yifan Yao; Zhong Huang; Yaping Mao; Jiannan Zhou (Discret. Appl. Math., 2025)

Ramsey and Gallai-Ramsey numbers for forests. - Yujia Gao; Meng Ji; Yaping Mao; Meiqin Wei (Discuss. Math. Graph Theory, 2025)

Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs. - Luyi Li; Xueliang Li 001; Yaping Mao; Yuan Si (Discuss. Math. Graph Theory, 2025)

Linear programming of monitoring the links of a fractional weighted network using distance. - Wen Li; Yaping Mao; Ralf Klasing (Inf. Comput., 2025)

The g-good-neighbor diagnosability of product networks under the PMC model. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing (Inf. Comput., 2025)

Monitoring the edges of product networks using distances. - Wen Li; Ralf Klasing; Yaping Mao; Bo Ning 001 (J. Comput. Syst. Sci., 2025)

Conditional Fractional Matching Preclusion Number of Graphs. - Wen Li; Yuhu Liu; Yinkui Li; Eddie Cheng 001; Yaping Mao (Int. J. Found. Comput. Sci., 2025)

Fault-tolerance in distance-edge-monitoring sets. - Chenxu Yang; Yaping Mao; Ralf Klasing; Gang Yang; Yuzhi Xiao; Xiaoyan Zhang (Acta Informatica, 2025)

The g-good-neighbor diagnosability of product networks under the PMC model. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing (CoRR, 2025)

Approximation algorithms for the total dominating set problem. - Limin Wang; Zhao Zhang; Donglei Du; Yaping Mao; Xiaoyan Zhang (J. Comb. Optim., 2025)