Yaping Mao

From MaRDI portal
Person:274704

Available identifiers

zbMath Open mao.yapingMaRDI QIDQ274704

List of research outcomes

PublicationDate of PublicationType
Complete bipartite graphs without small rainbow subgraphs2024-02-14Paper
On the distance-edge-monitoring numbers of graphs2024-01-24Paper
Size Gallai-Ramsey number2024-01-05Paper
Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs2023-10-25Paper
https://portal.mardi4nfdi.de/entity/Q60761502023-10-23Paper
Complete bipartite graphs without small rainbow stars2023-09-14Paper
Gallai-Ramsey numbers involving a rainbow 4-path2023-05-26Paper
Edge-disjoint Steiner trees and connectors in graphs2023-04-28Paper
Gallai-Ramsey numbers for fans2023-03-10Paper
Ramsey Achievement Games on Graphs : Algorithms and Bounds2023-03-06Paper
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs2023-02-21Paper
Gallai-Ramsey Multiplicity2023-02-20Paper
Constructing edge-disjoint Steiner trees in Cartesian product networks2023-01-26Paper
Popoviciu type inequalities for determinants2023-01-05Paper
Ramsey and Gallai-Ramsey numbers for the union of paths and stars2022-12-08Paper
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings2022-10-14Paper
Euclidean Gallai-Ramsey Theory2022-09-27Paper
Gallai-Ramsey number for the union of stars2022-09-12Paper
Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels2022-08-24Paper
Fractional Matching Preclusion for (n,k)-Star Graphs2022-07-04Paper
On relations between Sombor and other degree-based indices2022-05-31Paper
A general approach to deriving diagnosability results of interconnection networks2022-04-06Paper
Ramsey and Gallai-Ramsey number for wheels2022-03-15Paper
Some multivariable Rado numbers2022-03-05Paper
Fractional matching preclusion number of graphs2022-03-04Paper
A note on maximum fractional matchings of graphs2022-02-14Paper
Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree2022-01-28Paper
https://portal.mardi4nfdi.de/entity/Q50129892021-11-26Paper
https://portal.mardi4nfdi.de/entity/Q50129952021-11-26Paper
https://portal.mardi4nfdi.de/entity/Q51651982021-11-15Paper
Steiner (revised) Szeged index of graphs2021-10-26Paper
https://portal.mardi4nfdi.de/entity/Q51563552021-10-15Paper
https://portal.mardi4nfdi.de/entity/Q51564312021-10-15Paper
Generalized connectivity of some total graphs2021-09-16Paper
Bounds for the spectral radius and energy of extended adjacency matrix of graphs2021-09-13Paper
https://portal.mardi4nfdi.de/entity/Q50110512021-08-26Paper
Steiner Degree Distance of Two Graph Products2021-07-28Paper
Nordhaus-Guddum type results for the Steiner Gutman index of graphs2021-07-09Paper
Steiner diameter, maximum degree and size of a graph2021-06-14Paper
Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs2021-03-17Paper
On cycles that alternate through selected sets of vertices2021-02-16Paper
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph2021-02-10Paper
Inequalities for the Heinz mean of sector matrices2021-01-05Paper
Note on the connectivity keeping spiders in $k$-connected graphs2020-12-08Paper
https://portal.mardi4nfdi.de/entity/Q51331032020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q51332692020-11-12Paper
A note on the strong matching preclusion problem for data center networks2020-10-07Paper
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges2020-08-31Paper
Note on matching preclusion number of random graphs2020-08-03Paper
Bounds for Gallai-Ramsey functions and numbers2020-07-08Paper
Strong geodetic number of graphs and connectivity2020-04-23Paper
Fractional matching preclusion for generalized augmented cubes2020-01-13Paper
Gallai Ramsey number for double stars2020-01-08Paper
Conflict-free vertex-connections of graphs2020-01-08Paper
On the \(g\)-good-neighbor connectivity of graphs2019-12-27Paper
Fractional matching preclusion for arrangement graphs2019-11-06Paper
https://portal.mardi4nfdi.de/entity/Q52411342019-10-30Paper
The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products2019-10-02Paper
Gallai-Ramsey numbers for books2019-09-19Paper
On the $g$-extra connectivity of graphs2019-04-13Paper
Constructing edge-disjoint Steiner paths in lexicographic product networks2019-03-29Paper
Invulnerability of planar two-tree networks2019-03-26Paper
Gallai-Ramsey numbers for fans2019-02-27Paper
On conflict-free connection of graphs2019-02-20Paper
Matching preclusion number in product graphs2019-02-14Paper
A result on the 3-generalized connectivity of a graph and its line graph2019-01-31Paper
Proper connection number of graph products2019-01-31Paper
The Steiner diameter of a graph2019-01-25Paper
Matching preclusion number of graphs2019-01-18Paper
Steiner Distance in Product Networks2018-12-10Paper
Gallai-Ramsey numbers of odd cycles2018-08-28Paper
https://portal.mardi4nfdi.de/entity/Q45663602018-06-14Paper
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks2018-04-10Paper
Conflict-free connection numbers of line graphs2018-02-26Paper
https://portal.mardi4nfdi.de/entity/Q46041202018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q46041332018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q31343382018-02-09Paper
Strong matching preclusion number of graphs2018-02-06Paper
Inverse problem on the Steiner Wiener index2018-01-10Paper
https://portal.mardi4nfdi.de/entity/Q53677892017-10-20Paper
Steiner Distance in Graphs--A Survey2017-08-18Paper
https://portal.mardi4nfdi.de/entity/Q49775142017-08-16Paper
https://portal.mardi4nfdi.de/entity/Q52790932017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q52730762017-07-05Paper
Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs2017-05-23Paper
Steiner diameter, maximum degree and size of a graph2017-04-15Paper
The Steiner (n-3)-diameter of a graph2017-03-11Paper
A solution to a conjecture on the generalized connectivity of graphs2017-03-03Paper
The Steiner 4-diameter of a graph2017-02-18Paper
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs2017-01-23Paper
Graphs with large generalized (edge-)connectivity2016-11-11Paper
https://portal.mardi4nfdi.de/entity/Q28290702016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28240172016-10-06Paper
Generalized Connectivity of Graphs2016-08-10Paper
A small-world network derived from the deterministic uniform recursive tree by line graph operation2016-08-03Paper
https://portal.mardi4nfdi.de/entity/Q57410272016-07-20Paper
Rainbow vertex-connection and graph products2016-07-19Paper
The vertex-rainbow index of a graph2016-07-13Paper
Path-connectivity of lexicographic product graphs2016-05-06Paper
The minimal size of a graph with given generalized 3-edge-connectivity2016-05-04Paper
The Steiner Wiener index of a graph2016-04-25Paper
The minimal size of graphs with given pendant-tree connectivity2016-04-23Paper
Monochromatic connectivity and graph products2016-04-12Paper
Pendant-tree connectivity of line graphs2016-04-07Paper
Line k-Arboricity in Product Networks2016-03-13Paper
Path connectivity of line graphs2016-03-12Paper
The complexity of determining the vertex-rainbow index of graphs2016-02-22Paper
On the equitable vertex arboricity of complete tripartite graphs2016-02-22Paper
Searching for (near) Optimal Codes2016-02-05Paper
ON THE MERRIFIELD-SIMMONS INDEX AND HOSOYA INDEX OF TREE-TRIANGLE GRAPHS2016-01-11Paper
On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices2015-12-17Paper
The equitable vertex arboricity of complete tripartite graphs2015-09-15Paper
On the pedant tree-connectivity of graphs2015-08-28Paper
Interval minors of complete multipartite graphs2015-08-05Paper
On the Equitable Vertex Arboricity of Graphs2015-05-30Paper
On the regular k-independence number of graphs2015-05-19Paper
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs2015-04-28Paper
Graphs with large generalized 3-connectivity2015-04-13Paper
Note on the spanning-tree packing number of lexicographic product graphs2015-01-30Paper
On extremal graphs with internally disjoint Steiner trees2014-08-25Paper
On the generalized (edge-)connectivity of graphs2014-08-15Paper
The generalized 3-connectivity of Lexicographic product graphs2014-07-01Paper
The strong rainbow vertex-connection of graphs2014-06-11Paper
Additive codes over $GF(4)$ from circulant graphs2014-03-31Paper
Formally self-dual linear binary codes from circulant graphs2014-02-25Paper
Lower bounds for the spanning tree numbers of two graph products2013-07-09Paper
Further hardness results on the generalized connectivity of graphs2013-04-22Paper
https://portal.mardi4nfdi.de/entity/Q49014722013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q29062592012-09-05Paper
A survey on the generalized connectivity of graphs2012-07-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yaping Mao