49 citations
- Tsinghua UniversityCN9 papers
- Qinghai Normal UniversityCN4 papers
- Shanghai Jiao Tong UniversityCN4 papers
- State Key Laboratory of Ocean Engineering4 papers
- State Key Laboratory of Plateau Ecology and Agriculture3 papers
- University of Chinese Academy of SciencesCN3 papers
- Chinese Academy of SciencesCN2 papers
- Kavli Institute for the Physics and Mathematics of the UniverseJP2 papers
- National Astronomical Observatory of JapanJP2 papers
- Shanghai Ocean UniversityCN2 papers
- The University of TokyoJP2 papers
- Beijing Academy of Quantum Information SciencesCN1 paper
4 papers · 1 filter
Fractional matching preclusion for generalized augmented cubes
Tianlong Ma, Yaping Mao, Eddie Cheng +1
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A…
Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
Zhao Wang, Yaping Mao, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
Gallai-Ramsey numbers for books
Jinyu Zou, Yaping Mao, Colton Magnant +2
Given a graph and a positive integer , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices such that any -edge coloring of contains…
Path connectivity of line graphs
Yaping Mao
Dirac showed that in a -connected graph there is a path through each vertices. The path -connectivity of a graph , which is a generalization of Dirac's no…