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

32 papers

math.CO2026

A characterization of tight ( $k, 0$ )-stable graphs

Yuqi Xu, Weihua Yang, Xiaxia Guan

Let k and l be two non-negative integers with k > l. A graph G is (k,l)-stable if alpha(G - S) >= alpha(G) - l for every subset S of V(G) with |S| = k, where alpha(G) denotes the i…

math.CO2023

A stability result for $C_{2 k + 1}$ -free graphs

Sijie Ren, Jian Wang, Shipeng Wang +1

A graph $G$ is called $C_{2 k + 1}$ -free if it does not contain any cycle of length $2 k + 1$ . In 1981, Haggkvist, Faudree and Schelp showed that every $n$ -vertex triangle-free graph wit…

math.CO2022

Contractible Subgraphs of Contraction Critically Quasi $5$ -Connected Graphs

Shuai Kou, Chengfu Qin, Weihua Yang

Let $G$ be a contraction critically quasi $5$ -connected graph on at least $14$ vertices. If there is a vertex $x \in V_{4} (G)$ such that $G [N_{G} (x)] ≅ K_{1, 3}$ or $G[N_{G}(x)]\c…

math.CO2022

The minimum degree of minimally $t$ -tough graphs

Xiaomin Hu, Hui Ma, Weihua Yang

A graph $G$ is minimally $t$ -tough if the toughness of $G$ is $t$ and deletion of any edge from $G$ decreases its toughness. Katona et al. conjectured that the minimum de…

math.CO2022

An excluded minor theorem for the Wagner graph plus an edge

Yuqi Xu, Weihua Yang

Let $V_{8} + e$ denote the unique graph obtained from the Wagner graph, also known as $V_{8}$ , by adding an edge between two vertices of distance 3 on the Hamilton cycle, which is ex…

math.CO2022

Counterexamples to Gerbner's Conjecture on Stability of Maximal $F$ -free Graphs

Jian Wang, Shipeng Wang, Weihua Yang

Let $F$ be an $(r + 1)$ -color critical graph with $r \geq 2$ , that is, $χ (F) = r + 1$ and there is an edge $e$ in $F$ such that $χ (F - e) = r$ . Gerbner recently conjectured that every $n$ -ver…

math.CO2022

A $C_{4}$ -decomposition of the $λ$ -fold line graph of $K_{m, n}$

Yifan Zhao, Yulong Wei, Weihua Yang

The small cycle decompositions of line graph ( $λ$ -fold line graph) of complete graphs and complete bipartite graphs are studied by many papers. In particular, Colby and Rodger obta…

math.CO2022

Planar graphs without cycles of length from 4 to 7 are near-bipartite

Lili Hao, Weihua Yang, Shuang Zhao

A graph is near-bipartite if its vertex set can be partitioned into an independent set and a set which induces a forest. In this paper, planar graphs without cycles of length from…

math.CO2022

On the regular 2-connected 2-path Hamiltonian graphs

Xia Li, Weihua Yang

A graph $G$ is $l$ -path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. It is well known that a 2-connected, $k$ -regular graph $G$ on at…

math.CO2021★ 2 cited

Biharmonic distance of graphs

Yulong Wei, Rong-hua Li, Weihua Yang

Lipman et al. [ACM Transactions on Graphics 29 (3) (2010), 1--11] introduced the concept of biharmonic distance to measure the distances between pairs of points on a 3D surface. Bi…

math.CO2021

A note on $O c t_{1}^{+}$ -free graphs and $O c t_{2}^{+}$ -free graphs

Wenjian Jia, Shuai Kou, Chengfu Qin +1

Let $O c t_{1}^{+}$ and $O c t_{2}^{+}$ be the planar and non-planar graphs that obtained from the Octahedron by 3-splitting a vertex respectively. For $O c t_{1}^{+}$ , we prove that a 4…

math.CO2020

On traceable iterated line graph and hamiltonian path index

Zhaohong Nou, Liming Xiong, Weihua Yang

Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$ -th iterated lin…

math.CO2020★ 1 cited

A Stability Theorem for Maximal $C_{2 k + 1}$ -free Graphs

Jian Wang, Shipeng Wang, Weihua Yang +1

For any positive integer $k$ , we show that every maximal $C_{2 k + 1}$ -free graph with at least $n^{2} /4 - o (n^{3/2})$ edges contains an induced complete bipartite subgraph on $(1 - o (1)) n$ …

math.CO2020

The $g$ -extra edge-connectivity of balanced hypercubes

Yulong Wei, Rong-hua Li, Weihua Yang

The $g$ -extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464--473] determined…

math.CO2020★ 1 cited

Hybrid fault diagnosis capability analysis of highly connected graphs

Yulong Wei, Rong-hua Li, Weihua Yang

Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the $h$ -edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty…

cs.DS2020★ 1 cited

Scaling Up Distance-generalized Core Decomposition

Qiangqiang Dai, Rong-Hua Li, Lu Qin +4

Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-…

math.CO2018

The maximum number of triangles in graphs without large linear forests

Xiuzhuan Duan, Jian Wang, Weihua Yang

Let $G$ be a graph on $n$ vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of $G$ is a subgraph of $G$ with m…

math.CO2018

The Turán problem for a family of tight linear forests

Jian Wang, Weihua Yang

Let $F$ be a family of $r$ -graphs. The Turán number $e x_{r} (n; F)$ is defined to be the maximum number of edges in an $r$ -graph of order $n$ that is $F$ -…

math.CO2018

The Turán Number for Spanning Linear Forests

Jian Wang, Weihua Yang

For a set of graphs $F$ , the extremal number $e x (n; F)$ is the maximum number of edges in a graph of order $n$ not containing any subgraph isomorphic to some gra…

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★ 3 cited

Component edge connectivity of the folded hypercube

Shuli Zhao, Weihua Yang

The $g$ -component edge connectivity $c λ_{g} (G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this pap…

math.CO2018★ 1 cited

Reliability evaluation of folded hypercubes in terms of component connectivity

Shuli Zhao, Weihua Yang

The component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks. The $g$ -component connectivity $c…

math.CO2018

Embedding 5-planar graphs in three pages

Xiaxia Guan, Weihua Yang

A \emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the pages so that no two edges on the same page intersect.…

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 -…

A characterization of tight (k,0)-stable graphs

A stability result for C2k+1​-free graphs

Contractible Subgraphs of Contraction Critically Quasi 5-Connected Graphs

The minimum degree of minimally t-tough graphs

An excluded minor theorem for the Wagner graph plus an edge

Counterexamples to Gerbner's Conjecture on Stability of Maximal F-free Graphs

A C4​-decomposition of the λ-fold line graph of Km,n​

Planar graphs without cycles of length from 4 to 7 are near-bipartite

On the regular 2-connected 2-path Hamiltonian graphs

Biharmonic distance of graphs

A note on Oct1+​-free graphs and Oct2+​-free graphs

On traceable iterated line graph and hamiltonian path index

A Stability Theorem for Maximal C2k+1​-free Graphs

The g-extra edge-connectivity of balanced hypercubes

Hybrid fault diagnosis capability analysis of highly connected graphs

Scaling Up Distance-generalized Core Decomposition

The maximum number of triangles in graphs without large linear forests

The Turán problem for a family of tight linear forests

The Turán Number for Spanning Linear Forests

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

Component edge connectivity of the folded hypercube

Reliability evaluation of folded hypercubes in terms of component connectivity

Embedding 5-planar graphs in three pages

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

A characterization of tight ( $k, 0$ )-stable graphs

A stability result for $C_{2 k + 1}$ -free graphs

Contractible Subgraphs of Contraction Critically Quasi $5$ -Connected Graphs

The minimum degree of minimally $t$ -tough graphs

Counterexamples to Gerbner's Conjecture on Stability of Maximal $F$ -free Graphs

A $C_{4}$ -decomposition of the $λ$ -fold line graph of $K_{m, n}$

A note on $O c t_{1}^{+}$ -free graphs and $O c t_{2}^{+}$ -free graphs

A Stability Theorem for Maximal $C_{2 k + 1}$ -free Graphs

The $g$ -extra edge-connectivity of balanced hypercubes

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