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 2011Show all

5 papers · 1 filter

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…

math.CO2011★ 10 cited

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

Haoli Wang, Xirong Xu, Yuansheng Yang +1

Let $G = (V (G), E (G))$ be a simple connected and undirected graph with vertex set $V (G)$ and edge set $E (G)$ . A set $S \subseteq V (G)$ is a $d o mina t in g$ $se t$ if for each $v \in V (G)$ …

math.CO2011★ 1 cited

Roman domination number of Generalized Petersen Graphs P(n,2)

Haoli Wang, Xirong Xu, Yuansheng Yang +1

A $R o man d o mina t i o n f u n c t i o n$ on a graph $G = (V, E)$ is a function $f : V (G) \to {0, 1, 2}$ satisfying the condition that every vertex $u$ with $f (u) = 0$ is adjacent to at leas…

math.CO2011

The crossing number of cubes with small order

Guoqing Wang, Haoli Wang, Yuansheng Yang

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$ . In this paper, we give the exact values of crossing numbers f…

math.CO2011★ 2 cited

The crossing number of folded hypercubes

Haoli Wang, Yuansheng Yang, Yan Zhou +2

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$ . The {\it $n$ -dimensional folded hypercube} $F Q_{n}$ is a graph…