Weihua Yang

activity

20102026

most citedContinuous Dependence of Cauchy Problem For Nonlinear Schrödinger Equation in

H^{s}

3 citations · 17 across the 31 of their papers we have counts for

collaborators

Showing 2017Show all

7 papers · 1 filter

math.CO2017

A kind of conditional connectivity of transposition networks generated by $k$ -trees

Weihua Yang

For a graph $G = (V, E)$ , a subset $F \subset V (G)$ is called an $R_{k}$ -vertex-cut of $G$ if $G - F$ is disconnected and each vertex $u \in V (G) - F$ has at least $k$ neighbors in $G -…

math.CO2017

On the number of proper paths between vertices in edge-colored hypercubes

Lina Xue, Weihua Yang, Shurong Zhang

Given an integer $1 \leq j < n$ , define the $(j)$ -coloring of a $n$ -dimensional hypercube $H_{n}$ to be the $2$ -coloring of the edges of $H_{n}$ in which all edges in dimension $i$ ,…

math.CO2017★ 1 cited

A note on edge degree and spanning trail containing given edges

Weihua Yang, Hong-jian Lai, Baoyindureng Wu

Let $G$ be a simple graph with $n \geq 4$ vertices and $d (x) + d (y) \geq n + k$ for each edge $x y \in E (G)$ . In this work we prove that $G$ either contains a spanning closed trail containi…

math.CO2017★ 1 cited

On the existence of specified cycles in bipartite tournaments

Bo Zhang, Weihua Yang

For two integers $n \geq 3$ and $2 \leq p \leq n$ , we denote $D (n, p)$ the digraph obtained from a directed $n$ -cycle by changing the orientations of $p - 1$ consecutive arcs. In this pa…

math.CO2017

On the spanning connectivity of tournaments

Bo Zhang, Weihua Yang, Shurong Zhang

Let $D$ be a digraph. A $k$ -container of $D$ between $u$ and $v$ , $C (u, v)$ , is a set of $k$ internally disjoint paths between $u$ and $v$ . A $k$ -container $C (u, v)$ of $D$ is a stro…

math.CO2017

Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree

Maoqun Wang, Weihua Yang

The Bermond-Thomassen conjecture states that, for any positive integer $r$ , a digraph of minimum out-degree at least $2 r - 1$ contains at least $r$ vertex-disjoint directed cycles. I…

math.CO2017

Vertex-disjoint cycles in tournaments

Maoqun Wang, Weihua Yang

The Bermond-Thomassen conjecture states that, for any positive integer $r$ , a digraph of minimum out-degree at least $2 r - 1$ contains at least $r$ vertex-disjoint directed cycles. B…

A kind of conditional connectivity of transposition networks generated by k-trees

On the number of proper paths between vertices in edge-colored hypercubes

A note on edge degree and spanning trail containing given edges

On the existence of specified cycles in bipartite tournaments

On the spanning connectivity of tournaments

Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree

Vertex-disjoint cycles in tournaments

A kind of conditional connectivity of transposition networks generated by $k$ -trees