1 citations · 1 across the 9 of their papers we have counts for
7 papers · 1 filter
The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs
Hui Lei, Mei Lu, Yongtang Shi +2
Constructing the maximum spanning tree of an edge-weighted connected graph is one of the important research topics in computer science and optimization, and the related res…
Generalized Turán problems for a matching and long cycles
Xiamiao Zhao, Mei Lu
Let be a family of graphs. A graph is -free if does not contain any as a subgraph. The general Turán number, denoted by $ex(n,…
Partite saturation number of cycles
Yiduo Xu, Zhen He, Mei Lu
A graph is said to be -saturated relative to , if does not contain any copy of , but the addition of any edge in would create a copy of $…
Turán number of complete bipartite graphs with bounded matching number
Huan Luo, Xiamiao Zhao, Mei Lu
Let be a family of graphs. A graph is -free if does not contain any as a subgraph. The Turán number is th…
The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
Changchang Dong, Mei Lu, Jixiang Meng +1
Given a graph and a family of graphs , the maximum number of copies of in an -free graph on vertices is called the generalized Turán number, d…
On the total Italian domination number in digraphs
Changchang Dong, Yubao Guo, Mei Lu +1
Consider a finite simple digraph with vertex set . An Italian dominating function (IDF) on is a function satisfying every vertex with…
The inversion number of dijoins and blow-up digraphs
Haozhe Wang, Yuxuan Yang, Mei Lu
For an oriented graph , the of in is the digraph obtained from by reversing the direction of all arcs with both ends in . The inversion…