54 citations · 230 across the 74 of their papers we have counts for
8 papers · 1 filter
Fractional matching preclusion number of graphs
Jinyu Zou, Yaping Mao, Zhao Wang +1
The \emph{fractional matching preclusion number} of a graph , denoted by , is the minimum number of edges whose deletion results in a graph that has no fractional perfec…
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
Yaping Mao, Zhao Wang, 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…
Steiner (revised) Szeged index of graphs
Modjtaba Ghorbani, Xueliang Li, Hamid Reza Maimani +3
The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph of order…
Ramsey and Gallai-Ramsey number for wheels
Yaping Mao, Zhao Wang, 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…
On the -good-neighbor connectivity of graphs
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh +1
Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network . In 1996, Fàbrega and Fiol proposed the -good-neighbor conn…
On the -extra connectivity of graphs
Zhao Wang, Yaping Mao, Sun-Yuan Hsieh
Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network . In 1996, Fàbrega and Fiol proposed the -extra connectivity…