Yaping Mao

Orcid: 0000-0001-9134-237X

According to our database1, Yaping Mao authored at least 89 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distance-edge-monitoring sets of networks.
Acta Informatica, June, 2024

Gallai-Ramsey Multiplicity.
Graphs Comb., May, 2024

A Commentary on the Progress of Big Data in Combinatorial Optimization.
Parallel Process. Lett., March, 2024

Online Single-Processor Scheduling with an Unexpected Breakdown.
Asia Pac. J. Oper. Res., February, 2024

On the distance-edge-monitoring numbers of graphs.
Discret. Appl. Math., January, 2024

Erdös-Gallai-type problems for distance-edge-monitoring numbers.
Discret. Appl. Math., January, 2024

Perturbation Results for Distance-edge-monitoring Numbers.
Fundam. Informaticae, 2024

Complete bipartite graphs without small rainbow subgraphs.
Discret. Appl. Math., 2024

2023
Size Gallai-Ramsey Number.
Graphs Comb., December, 2023

Complete bipartite graphs without small rainbow stars.
Discret. Appl. Math., December, 2023

A distributed message passing algorithm for computing perfect demand matching.
J. Parallel Distributed Comput., September, 2023

Gallai-Ramsey Numbers Involving a Rainbow 4-Path.
Graphs Comb., June, 2023

Gallai-Ramsey numbers for fans.
Discret. Math., May, 2023

Edge-Disjoint Steiner Trees and Connectors in Graphs.
Graphs Comb., April, 2023

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings.
J. Comb. Theory A, 2023

Ramsey and Gallai-Ramsey numbers for the union of paths and stars.
Discret. Appl. Math., 2023

Streaming Algorithms for the k-Submodular Cover Problem.
CoRR, 2023

Constructing disjoint Steiner trees in Sierpiński graphs.
CoRR, 2023

2022
On relations between Sombor and other degree-based indices.
J. Appl. Math. Comput., February, 2022

A general approach to deriving diagnosability results of interconnection networks.
Int. J. Parallel Emergent Distributed Syst., 2022

A note on maximum fractional matchings of graphs.
J. Comb. Optim., 2022

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

Ramsey and Gallai-Ramsey Number for Wheels.
Graphs Comb., 2022

Gallai-Ramsey numbers for rainbow <i>P</i><sub>5</sub> and monochromatic fans or wheels.
Discret. Math., 2022

Fractional matching preclusion number of graphs.
Discret. Appl. Math., 2022

Monitoring the edges of product networks using distances.
CoRR, 2022

On the distance-edge-monitoring numbers of graphs.
CoRR, 2022

Multi-type feature fusion based on graph neural network for drug-drug interaction prediction.
BMC Bioinform., 2022

2021
Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree.
Math. Comput. Sci., 2021

Preface.
J. Interconnect. Networks, 2021

Strong Equitable Vertex Arboricity in Cartesian Product Networks.
J. Interconnect. Networks, 2021

Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs.
Graphs Comb., 2021

Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph.
Discuss. Math. Graph Theory, 2021

Steiner diameter, maximum degree and size of a graph.
Discret. Math., 2021

2020
On the <i>g</i>-good-neighbor connectivity of graphs.
Theor. Comput. Sci., 2020

Note on matching preclusion number of random graphs.
Theor. Comput. Sci., 2020

Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs.
Symmetry, 2020

A note on the strong matching preclusion problem for data center networks.
Inf. Process. Lett., 2020

On Cycles that Alternate Through Selected Sets of Vertices.
Graphs Comb., 2020

Conflict-free vertex-connections of graphs.
Discuss. Math. Graph Theory, 2020

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges.
Discret. Appl. Math., 2020

2019
Invulnerability of planar two-tree networks.
Theor. Comput. Sci., 2019

Matching preclusion number of graphs.
Theor. Comput. Sci., 2019

Matching preclusion number in product graphs.
Theor. Comput. Sci., 2019

A Concise Survey of Matching Preclusion in Interconnection Networks.
J. Interconnect. Networks, 2019

Preface.
J. Interconnect. Networks, 2019

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs.
J. Inf. Sci. Eng., 2019

Fractional matching preclusion for generalized augmented cubes.
Discret. Math. Theor. Comput. Sci., 2019

Gallai-Ramsey numbers for books.
Discret. Appl. Math., 2019

Fractional matching preclusion for arrangement graphs.
Discret. Appl. Math., 2019

On conflict-free connection of graphs.
Discret. Appl. Math., 2019

2018
Strong matching preclusion number of graphs.
Theor. Comput. Sci., 2018

Fractional Matching Preclusion for (<i>n</i>, <i>k</i>)-Star Graphs.
Parallel Process. Lett., 2018

On the Steiner 4-Diameter of Graphs.
J. Interconnect. Networks, 2018

A note on the Steiner -diameter of a graph.
Int. J. Comput. Math. Comput. Syst. Theory, 2018

Steiner Distance in Product Networks.
Discret. Math. Theor. Comput. Sci., 2018

Inverse problem on the Steiner Wiener index.
Discuss. Math. Graph Theory, 2018

Constructing internally disjoint pendant Steiner trees in Cartesian product networks.
Australas. J Comb., 2018

The k-independence number of graph products.
Art Discret. Appl. Math., 2018

Fractional Matching Preclusion for (Burnt) Pancake Graphs.
Proceedings of the 15th International Symposium on Pervasive Systems, 2018

2017
Super Edge-Connectivity of Strong Product Graphs.
J. Interconnect. Networks, 2017

A solution to a conjecture on the generalized connectivity of graphs.
J. Comb. Optim., 2017

Trees with large numbers of subtrees.
Int. J. Comput. Math., 2017

Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs.
Discret. Appl. Math., 2017

The chromatic equivalence class of graph ψ<sub>n</sub><sup>3</sup>(n-3, 1).
Ars Comb., 2017

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

Steiner Distance in Join, Corona and Threshold Graphs.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

Conflict-Free Connection Numbers of Line Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Linear <i>k</i>-Arboricity in Product Networks.
J. Interconnect. Networks, 2016

Rainbow vertex-connection and graph products.
Int. J. Comput. Math., 2016

Path-connectivity of lexicographic product graphs.
Int. J. Comput. Math., 2016

The vertex-rainbow index of a graph.
Discuss. Math. Graph Theory, 2016

Graphs with large generalized (edge-)connectivity.
Discuss. Math. Graph Theory, 2016

The Steiner Wiener index of a graph.
Discuss. Math. Graph Theory, 2016

Monochromatic connectivity and graph products.
Discret. Math. Algorithms Appl., 2016

The fifth coefficient of adjoint polynomial and a new invariant.
Ars Comb., 2016

2015
The equitable vertex arboricity of complete tripartite graphs.
Inf. Process. Lett., 2015

On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices.
Graphs Comb., 2015

The complexity of determining the vertex-rainbow index of graphs.
Discret. Math. Algorithms Appl., 2015

Note on the spanning-tree packing number of lexicographic product graphs.
Discret. Math., 2015

Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs.
Discret. Appl. Math., 2015

The minimal size of a graph with given generalized 3-edge-connectivity.
Ars Comb., 2015

Searching for (near) Optimal Codes.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
The generalized 3-connectivity of Lexicographic product graphs.
Discret. Math. Theor. Comput. Sci., 2014

Additive codes over $GF(4)$ from circulant graphs.
CoRR, 2014

Formally self-dual linear binary codes from circulant graphs.
CoRR, 2014

Note on the generalized connectivity.
Ars Comb., 2014

On the generalized (edge-)connectivity of graphs.
Australas. J Comb., 2014

2012
A survey on the generalized connectivity of graphs
CoRR, 2012


  Loading...