Mei Lu

activity

20242026

most citedThe inversion number of dijoins and blow-up digraphs

1 citations · 1 across the 9 of their papers we have counts for

collaborators

10 papers

math.CO2026

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs

Yichen Wang, Haixiang Zhang, Mei Lu

Given a graph $G = (V, E)$ , a vertex $u \in V$ {\em ve-dominates} all edges incident to any vertex of $N_{G} [u]$ . A set $S \subseteq V$ is a {\em ve-dominating set} if for all edges $e\…

math.CO2026

Extremal results on Berge disjoint paths

Xiamiao Zhao, Yiyan Zhan, Mei Lu

The well-known Erdős-Gallai Theorem gave the Turán number of paths. Bushaw and Kettle generalized this result to consider the Turán number of disjoint paths. Since then, many studi…

math.CO2025

Turán type problems for a fixed graph and a linear forest

Haixiang Zhang, Xiamiao Zhao, Mei Lu

Let $F$ be a family of graphs. A graph $G$ is $F$ -free if $G$ does not contain any $F \in F$ as a subgraph. The Turán number, denoted by $ex(n, \mathsc…

math.CO2024

The Minimum Weighting Ratio Problem and Its Application in Chordal Graphs

Hui Lei, Mei Lu, Yongtang Shi +2

Constructing the maximum spanning tree $T$ of an edge-weighted connected graph $G$ is one of the important research topics in computer science and optimization, and the related res…

math.CO2024

Generalized Turán problems for a matching and long cycles

Xiamiao Zhao, Mei Lu

Let $F$ be a family of graphs. A graph $G$ is $F$ -free if $G$ does not contain any $F \in F$ as a subgraph. The general Turán number, denoted by $ex(n,…

math.CO2024

Partite saturation number of cycles

Yiduo Xu, Zhen He, Mei Lu

A graph $H$ is said to be $F$ -saturated relative to $G$ , if $H$ does not contain any copy of $F$ , but the addition of any edge $e$ in $E (G) \ E (H)$ would create a copy of $…

math.CO2024

Turán number of complete bipartite graphs with bounded matching number

Huan Luo, Xiamiao Zhao, Mei Lu

Let $F$ be a family of graphs. A graph $G$ is $F$ -free if $G$ does not contain any $F \in F$ as a subgraph. The Turán number $e x (n, F)$ is th…

math.CO2024

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

Changchang Dong, Mei Lu, Jixiang Meng +1

Given a graph $T$ and a family of graphs $F$ , the maximum number of copies of $T$ in an $F$ -free graph on $n$ vertices is called the generalized Turán number, d…

math.CO2024

On the total Italian domination number in digraphs

Changchang Dong, Yubao Guo, Mei Lu +1

Consider a finite simple digraph $D$ with vertex set $V (D)$ . An Italian dominating function (IDF) on $D$ is a function $f : V (D) \to {0, 1, 2}$ satisfying every vertex $u$ with…

math.CO2024★ 1 cited

The inversion number of dijoins and blow-up digraphs

Haozhe Wang, Yuxuan Yang, Mei Lu

For an oriented graph $D$ , the $in v er s i o n$ of $X \subseteq V (D)$ in $D$ is the digraph obtained from $D$ by reversing the direction of all arcs with both ends in $X$ . The inversion…