Mei Lu

activity

20242026

collaborators

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

math.CO2025

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.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, \maths…

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…