5 citations · 7 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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.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…