Shengxiang Lv

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

The crossing number of hexagonal graph H_{3, n} in the projective plane.

Jing Wang, Junliang Cai, Shengxiang Lv, Yuanqiu Huang

Discuss. Math. Graph Theory, 2022

2021

Mechanism Linking AR-Based Presentation Mode and Consumers' Responses: A Moderated Serial Mediation Model.

Xi Han, Feng Wang, Shengxiang Lv, Wenting Han

J. Theor. Appl. Electron. Commer. Res., 2021

2019

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

Shengxiang Lv, Yichao Chen

Discret. Math., 2019

2018

The smallest surface that contains all signed graphs on K_4,n.

Shengxiang Lv, Zihan Yuan

Discret. Math., 2018

2015

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

Shengxiang Lv

Graphs Comb., 2015

2011

Up-embeddability and independent number of simple graphs.

Shengxiang Lv, Yanpei Liu

Ars Comb., 2011

A new bound on maximum genus of simple graphs.

Shengxiang Lv, Yanpei Liu

Ars Comb., 2011

2010

Up-embeddability of graphs with small order.

Shengxiang Lv, Yanpei Liu

Appl. Math. Lett., 2010

2007

The Crossing Number of Cartesian Products of Complete Bipartite Graphs <i>K</i> _{2, <i>m</i>} with Paths <i>P</i> _<i>n</i>.

Ling Tang, Shengxiang Lv, Yuanqiu Huang

Graphs Comb., 2007