Mei Lu

activity

20132022

most citedAnti-Ramsey problems in the generalized Petersen graphs for cycles

3 citations · 7 across the 10 of their papers we have counts for

collaborators

Showing 2021Show all

5 papers · 1 filter

math.CO2021★ 3 cited

Anti-Ramsey problems in the generalized Petersen graphs for cycles

Huiqing Liu, Mei Lu, Shunzhe Zhang

The anti-Ramsey number $A r (G, H)$ is the maximum number of colors in an edge-coloring of $G$ with no rainbow copy of $H$ . In this paper, we determine the exact anti-Ramsey number in…

math.CO2021

Rainbow Independent Sets in Cycles

Zequn Lv, Mei Lu

For a given class $C$ of graphs and given integers $m \leq n$ , let $f_{C} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in any graph belonging…

math.CO2021

On graphs with exactly one anti-adjacency eigenvalue and beyond

Jianfeng Wang, Xingyu Lei, Mei Lu +2

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpret…

math.CO2021

Treewidth of the $q$ -Kneser graphs

Mengyu Cao, Ke Liu, Mei Lu +1

Let $V$ be an $n$ -dimensional vector space over a finite field $F_{q}$ , where $q$ is a prime power. Define the \emph{generalized $q$ -Kneser graph} $K_{q} (n, k, t)$ to be the gra…

math.CO2021

$w$ -Dominating Set Problem on Graphs of Bounded Treewidth

Ke Liu, Mei Lu

Let $G = (V, E)$ be a graph. Let $w$ be a positive integer. A $w$ -dominating set is a vertex subset $S$ such that for all $v \in V$ , either $v \in S$ or it has at least $w$ neighbors in…

Anti-Ramsey problems in the generalized Petersen graphs for cycles

Rainbow Independent Sets in Cycles

On graphs with exactly one anti-adjacency eigenvalue and beyond

Treewidth of the q-Kneser graphs

w-Dominating Set Problem on Graphs of Bounded Treewidth

Treewidth of the $q$ -Kneser graphs

$w$ -Dominating Set Problem on Graphs of Bounded Treewidth