Haoli Wang

activity

20112018

most citedDavenport constant of the multiplicative semigroup of the quotient ring $\frac{\F_p[x]}{\langle f(x)\rangle}$

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

collaborators

10 papers

math.CO2018

On the modular Erdős-Burgess constant

Jun Hao, Haoli Wang, Lizhen Zhang

Let $n$ be a positive integer. For any integer $a$ , we say that $a$ is idempotent modulo $n$ if $a^{2} \equiv a (mod n)$ . The $n$ -modular Erdős-Burgess constant is the smallest positiv…

math.CO2018

On the Erdős-Burgess constant of the multiplicative semigroup of a factor ring of $F_{q} [x]$

Haoli Wang, Jun Hao, Lizhen Zhang

Let $S$ be a commutative semigroup endowed with a binary associative operation $+$ . An element $e$ of $S$ is said to be idempotent if $e + e = e$ . The {\sl Erdős-Bu…

math.NT2014★ 5 cited

Davenport constant of the multiplicative semigroup of the quotient ring $\frac{\F_p[x]}{\langle f(x)\rangle}$

Haoli Wang, Lizhen Zhang, Qinghong Wang +1

Let $S$ be a finite commutative semigroup. The Davenport constant of $S$ , denoted $D (S)$ , is defined to be the least positive integer $d$ such that ev…

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…

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

On the 3- $γ_{t}$ -Critical Graphs of Order $Δ (G) + 3$

Haoli Wang, Xirong Xu, Yang Yuansheng +1

Let $γ_{t} (G)$ be the total domination number of graph $G$ , a graph $G$ is $k$ -total domination vertex critical (or\ just\ $k$ - $γ_{t}$ -critical) if $γ_{t} (G) = k$ , and for any vertex $v$ o…

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…

On the modular Erdős-Burgess constant

On the Erdős-Burgess constant of the multiplicative semigroup of a factor ring of Fq​[x]

Davenport constant of the multiplicative semigroup of the quotient ring $\frac{\F_p[x]}{\langle f(x)\rangle}$

An upper bound for the crossing number of augmented cubes

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

The crossing number of locally twisted cubes

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

On the 3-γt​-Critical Graphs of Order Δ(G)+3

The crossing number of cubes with small order

The crossing number of folded hypercubes

On the Erdős-Burgess constant of the multiplicative semigroup of a factor ring of $F_{q} [x]$

On the 3- $γ_{t}$ -Critical Graphs of Order $Δ (G) + 3$