Shengxiang Lv

According to our database1, Shengxiang Lv authored at least 9 papers between 2007 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The crossing number of hexagonal graph H<sub>3, n</sub> in the projective plane.
Discuss. Math. Graph Theory, 2022

2021
Mechanism Linking AR-Based Presentation Mode and Consumers' Responses: A Moderated Serial Mediation Model.
J. Theor. Appl. Electron. Commer. Res., 2021

2019
Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n.
Discret. Math., 2019

2018
The smallest surface that contains all signed graphs on K<sub>4,n</sub>.
Discret. Math., 2018

2015
The Largest Demigenus Over All Signatures on K 3, n.
Graphs Comb., 2015

2011
Up-embeddability and independent number of simple graphs.
Ars Comb., 2011

A new bound on maximum genus of simple graphs.
Ars Comb., 2011

2010
Up-embeddability of graphs with small order.
Appl. Math. Lett., 2010

2007
The Crossing Number of Cartesian Products of Complete Bipartite Graphs <i>K</i> <sub>2, <i>m</i> </sub> with Paths <i>P</i> <sub> <i>n</i> </sub>.
Graphs Comb., 2007


  Loading...