4 citations · 16 across the 20 of their papers we have counts for
20 papers
On the -hull numbers of -Kneser graphs and Grassmann graphs
Jiaqi Liao, Mengyu Cao, Mei Lu
Let be an -dimensional vector space over the finite field , where is necessarily a prime power. Denote (resp. ) to be the \emph{-Kn…
Anti-Ramsey problems in the generalized Petersen graphs for cycles
Huiqing Liu, Mei Lu, Shunzhe Zhang
The anti-Ramsey number is the maximum number of colors in an edge-coloring of with no rainbow copy of . In this paper, we determine the exact anti-Ramsey number in…
Rainbow Independent Sets in Cycles
Zequn Lv, Mei Lu
For a given class of graphs and given integers , let be the minimal number such that every independent -sets in any graph belonging…
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…
Treewidth of the -Kneser graphs
Mengyu Cao, Ke Liu, Mei Lu +1
Let be an -dimensional vector space over a finite field , where is a prime power. Define the \emph{generalized -Kneser graph} to be the gra…
-Dominating Set Problem on Graphs of Bounded Treewidth
Ke Liu, Mei Lu
Let be a graph. Let be a positive integer. A -dominating set is a vertex subset such that for all , either or it has at least neighbors in…