Yuansheng Yang

activity

20112022

most citedOn the Domination Number of Generalized Petersen Graphs P(ck,k)

10 citations · 15 across the 15 of their papers we have counts for

collaborators

Showing math.COShow all

10 papers · 1 filter

math.CO2022

The crossing number of the complete 4-partite graph $K_{1, 1, m, n}$

Xiwu Yang, Ni Lu, Xiaodong Chen +1

Let $cr (G)$ denote the crossing number of a graph $G$ . The well-known Zarankiewicz's conjecture (ZC) asserted $cr (K_{m, n})$ in 1954. In 1971, Harborth gave a conj…

math.CO2020

Italian domination in generalized Petersen graphs

Hong Gao, Jiahuan Huang, Yanan Yin +1

In a graph $G = (V, E)$ , each vertex $v \in V$ is labelled with $0$ , $1$ or $2$ such that each vertex labelled with $0$ is adjacent to at least one vertex labelled $2$ or two vertices…

math.CO2019

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs

Huifeng Zhang, Xirong Xu, Jing Guo +1

The twisted hypercube-like networks( $T H L N s$ ) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of $n$ -dimensional( $n$ - $D$ …

math.CO2012

An upper bound for the crossing number of augmented cubes

Guoqing Wang, Haoli Wang, Yuansheng Yang +2

A {\it good drawing} of a graph $G$ is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex…

math.CO2012★ 2 cited

Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes

Yuansheng Yang, Guoqing Wang, Haoli Wang +1

Let $Q_{n}$ be the $n$ -dimensional hypercube, and let $cr (Q_{n})$ be the \textit{crossing number} of $Q_{n}$ . Erdős and Guy in 1973 conjectured the following equality: ${\rm cr}(Q_…

math.CO2011

The crossing number of locally twisted cubes

Haoli Wang, Xirong Xu, Yuansheng Yang +3

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$ . Motivated by the recent work [Faria, L., Figueiredo, C.M.H. d…