default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjian Lv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Tian Yao, Benjian Lv, Kaishun Wang:
Large non-trivial $t$-intersecting families of signed sets. Australas. J Comb. 89: 32-48 (2024)- [j24]Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang:
Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families. Eur. J. Comb. 120: 103958 (2024) - 2023
- [j23]Mengyu Cao, Mei Lu, Benjian Lv
, Kaishun Wang:
r-cross t-intersecting families for vector spaces. J. Comb. Theory A 193: 105688 (2023) - 2022
- [j22]Tian Yao, Benjian Lv, Kaishun Wang:
Extremal t-intersecting families for direct products. Discret. Math. 345(11): 113026 (2022) - [j21]Tian Yao, Benjian Lv, Kaishun Wang:
Non-trivial t-intersecting families for symplectic polar spaces. Finite Fields Their Appl. 77: 101955 (2022) - [j20]Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou:
Nontrivial t-Intersecting Families for Vector Spaces. SIAM J. Discret. Math. 36(3): 1823-1847 (2022) - 2021
- [j19]Mengyu Cao, Benjian Lv, Kaishun Wang:
On even-cycle-free subgraphs of the doubled Johnson graphs. Appl. Math. Comput. 403: 125763 (2021) - [j18]Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou:
Extremal even-cycle-free subgraphs of the complete transposition graphs. Appl. Math. Comput. 405: 126223 (2021) - [j17]Mengyu Cao, Benjian Lv, Kaishun Wang:
The structure of large non-trivial t-intersecting families of finite sets. Eur. J. Comb. 97: 103373 (2021) - 2020
- [j16]Li-Ping Huang, Benjian Lv, Kaishun Wang:
Automorphisms of Grassmann graphs over a residue class ring. Discret. Math. 343(4): 111693 (2020)
2010 – 2019
- 2019
- [j15]Li-Ping Huang, Benjian Lv, Kaishun Wang:
Erdős-Ko-Rado theorem, Grassmann graphs and ps-Kneser graphs for vector spaces over a residue class ring. J. Comb. Theory A 164: 125-158 (2019) - 2018
- [j14]Hui Gao, Benjian Lv, Kaishun Wang:
Two lower bounds for generalized 3-connectivity of Cartesian product graphs. Appl. Math. Comput. 338: 305-313 (2018) - [j13]Yuefeng Yang, Benjian Lv, Kaishun Wang:
Weakly distance-regular digraphs of valency three, II. J. Comb. Theory A 160: 288-315 (2018) - 2017
- [j12]Benjian Lv, Li-Ping Huang, Kaishun Wang:
Endomorphisms of Twisted Grassmann Graphs. Graphs Comb. 33(1): 157-169 (2017) - [j11]Li-Ping Huang, Benjian Lv:
Cores and Independence Numbers of Grassmann Graphs. Graphs Comb. 33(6): 1607-1620 (2017) - 2016
- [j10]Li-Ping Huang, Benjian Lv, Kaishun Wang:
The endomorphisms of Grassmann graphs. Ars Math. Contemp. 10(2): 383-392 (2016) - [j9]Yuefeng Yang, Benjian Lv, Kaishun Wang:
Weakly Distance-Regular Digraphs of Valency Three, I. Electron. J. Comb. 23(2): 2 (2016) - 2015
- [j8]Benjian Lv, Kaishun Wang:
The Terwilliger algebra of the incidence graphs of Johnson geometry, II. Discret. Math. 338(12): 2378-2386 (2015) - 2014
- [j7]Min Feng, Benjian Lv, Kaishun Wang:
On the fractional metric dimension of graphs. Discret. Appl. Math. 170: 55-63 (2014) - [j6]Benjian Lv, Carolina Maldonado, Kaishun Wang:
More on the Terwilliger algebra of Johnson schemes. Discret. Math. 328: 54-62 (2014) - [j5]Benjian Lv, Kaishun Wang, Jun Guo:
Error-tolerance pooling designs based on Johnson graphs. Optim. Lett. 8(3): 1161-1165 (2014) - 2013
- [j4]Qian Kong, Benjian Lv, Kaishun Wang:
The Terwilliger Algebra of the Incidence Graphs of Johnson Geometry. Electron. J. Comb. 20(4): 5 (2013) - [j3]Benjian Lv, Kaishun Wang:
The energy of qq-Kneser graphs and attenuated qq-Kneser graphs. Discret. Appl. Math. 161(13-14): 2079-2083 (2013) - [j2]Qian Kong, Benjian Lv, Kaishun Wang:
The Terwilliger algebra of Odd graphs. Discret. Math. 313(5): 698-703 (2013) - 2012
- [j1]Benjian Lv, Kaishun Wang:
The eigenvalues of q-Kneser graphs. Discret. Math. 312(6): 1144-1147 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
