E. Cheng

activity

20172019

most citedSteiner Distance in Product Networks

17 citations · 25 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2019

Fractional matching preclusion number of graphs

Jinyu Zou, Yaping Mao, Zhao Wang +1

The \emph{fractional matching preclusion number} of a graph $G$ , denoted by $f m p (G)$ , is the minimum number of edges whose deletion results in a graph that has no fractional perfec…

math.CO2019★ 5 cited

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…

math.CO2018

Matching preclusion number of graphs

Zhao Wang, Yaping Mao, Eddie Cheng +1

The \emph{matching preclusion number} of a graph $G$ , denoted by $\mpo(G)$, is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor…

math.CO2018

Minimum degree and size conditions for the proper connection number of graphs

Xiaxia Guan, Lina Xue, Eddie Cheng +1

An edge-coloured graph $G$ is called $p r o p er l y$ $co nn ec t e d$ if every two vertices are connected by a proper path. The $p r o p er$ $co nn ec t i o n$ $n u mb er$ of a connected graph $G$ , denot…

math.CO2018★ 1 cited

Two kinds of generalized connectivity of dual cubes

Shu-Li Zhao, Rong-Xia Hao, Eddie Cheng

Let $S \subseteq V (G)$ and $κ_{G} (S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \dots, T_{k}$ in $G$ such that $V (T_{i}) ⋂ V (T_{j}) = S$ for any $i, j…

math.CO2017★ 2 cited

The Steiner (n-3)-diameter of a graph

Yaping Mao, Christopher Melekian, Eddie Cheng

The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected…