Benjian Lv

activity

20112026

most citedWeakly distance-regular digraphs of valency three, I

8 citations · 28 across the 30 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.GR2026

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

Mengyu Cao, Benjian Lv, Binzhou Xia

We determine the full automorphism group of every connected Cayley graph on an almost simple group with a normal connection set. We also characterize exactly when the full automorp…

math.CO2026

Extremal cross $t$ -intersecting families under $t$ -covering number constraints for vector spaces

Yu Zhu, Benjian Lv, Kaishun Wang

Let $V$ be an $n$ -dimensional vector space over the finite field $F_{q}$ , and $[k V]$ denote the family of all $k$ -dimensional subspaces of $V$ . The families $\mathcal…

math.CO2026

On extremal cross $t$ -intersecting families with $t$ -covering number conditions

Yu Zhu, Benjian Lv, Kaishun Wang

Let $n$ , $k$ and $t$ be positive integers, and let $F$ be a collection of $k$ -subsets of $[n] = {1, 2, \dots, n}$ . The $t$ -covering number $τ_{t} (F)$ of $\mathcal{F}…

Automorphism groups of Cayley graphs on almost simple groups with normal connection sets

Extremal cross t-intersecting families under t-covering number constraints for vector spaces

On extremal cross t-intersecting families with t-covering number conditions

Extremal cross $t$ -intersecting families under $t$ -covering number constraints for vector spaces

On extremal cross $t$ -intersecting families with $t$ -covering number conditions