7 citations · 8 across the 10 of their papers we have counts for
7 papers · 1 filter
Constructing edge-disjoint Steiner trees in Cartesian product networks
Rui Li, Gregory Gutin, He Zhang +3
Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. Fo…
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
Ansong Ma, Yuefang Sun, Xiaoyan Zhang
Let be a digraph. We define the minimum semi-degree of as . Let be a positive integer, and let and $T = \{t_{1}, \d…
Packing Strong Subgraph in Digraphs
Yuefang Sun, Gregory Gutin, Xiaoyan Zhang
In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph pa…
Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
Zan-Bo Zhang, Xiaoyan Zhang, Xuelian Wen
In 1972, Woodall raised the following Ore type condition for directed Hamilton cycles in digraphs: Let be a digraph. If for every vertex pair and , where there is no arc…
Minimum size of n-factor-critical graphs and k-extendable graphs
Zanbo Zhang, Xiaoyan Zhang, Dingjun Lou +1
We determine the minimum size of -factor-critical graphs and that of -extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the…
Notes on factor-criticality, extendibility and independence number
Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang
In this paper, we give a sufficient and necessary condition for a -extendable graph to be -factor-critical when , and prove some results on independence numbers in $n…
New versions of the all-ones problem
Xueliang Li, Xiaoyan Zhang
We study three new versions of the All-Ones Problem and the Minimum All-Ones Problem. The original All-Ones Problem is simply called the Vertex-Vertex Problem, and the three new ve…