3 citations · 17 across the 31 of their papers we have counts for
7 papers · 1 filter
The maximum number of triangles in graphs without large linear forests
Xiuzhuan Duan, Jian Wang, Weihua Yang
Let be a graph on vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of is a subgraph of with m…
The Turán problem for a family of tight linear forests
Jian Wang, Weihua Yang
Let be a family of -graphs. The Turán number is defined to be the maximum number of edges in an -graph of order that is -…
The Turán Number for Spanning Linear Forests
Jian Wang, Weihua Yang
For a set of graphs , the extremal number is the maximum number of edges in a graph of order not containing any subgraph isomorphic to some gra…
Minimum degree and size conditions for the proper connection number of graphs
Xiaxia Guan, Lina Xue, Eddie Cheng +1
An edge-coloured graph is called if every two vertices are connected by a proper path. The of a connected graph , denot…
Component edge connectivity of the folded hypercube
Shuli Zhao, Weihua Yang
The -component edge connectivity of a non-complete graph is the minimum number of edges whose deletion results in a graph with at least components. In this pap…
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 -component connectivity $c…
Embedding 5-planar graphs in three pages
Xiaxia Guan, Weihua Yang
A \emph{book-embedding} of a graph is an embedding of vertices of along the spine of a book, and edges of on the pages so that no two edges on the same page intersect.…