Yunjian Wu

Yunjian Wu

Auto-generated profile, based on publicly available information

Yunjian Wu

Department of Mathematics, Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2012 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
YWYunjian Wu
Yunjian Wu
NRN. Jafari Rad
N. Jafari Rad

2 March 2010 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
MKMikio Kano
Mikio Kano
YWYunjian Wu
Yunjian Wu
QYQinglin Yu
Qinglin Yu

6 May 2010 in arXiv
Verified
Preprint
Open access
PDF file
YWYunjian Wu
Yunjian Wu
NRN. Jafari Rad
N. Jafari Rad
A {\it 2-rainbow domination function} of a graph $G$ is a function $f$ that assigns to each vertex a set of colors chosen from the set $\{1,2\}$, such that for any $v\in V(G)$, $f(v)=\emptyset$ implies $\bigcup_{u\in N(v)}f(u)=\{1,2\}$. The {\it 2-rainbow domination number $\gamma_{r2}(G)$} of a graph $G$ is the minimum $w(f)=\Sigma_{v\in V}|f(v)|$ over all such functions $f$. Let $G$ be a connected graph of order $|V(G)|=n\geq 3$. We prove that $\gamma_{r2}(G)\leq 3n/4$ and we characterize the graphs achieving equality. We also prove a lower bound for 2-rainbow domination number of a tree using its domination number. Some other lower and upper bounds of $\gamma_{r2}(G)$ in terms of diameter are also given.

1 January 2009 in Networks
Verified
Journal Article
Closed access
PDF file
Yuqing LinYuqing Lin
Yuqing Lin
HLHongliang Lu
Hongliang Lu
YWYunjian Wu
Yunjian Wu
QYQinglin Yu
Qinglin Yu

16 May 2019 in Open Mathematics
Verified
Journal Article
Open access
PDF file
YWYunjian Wu
Yunjian Wu
Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition functions by using Hecke operators. In this note, we establish new parity results for broken 11-diamond partition functions. In particular, we generalize the congruences due to Dai by utilizing an identity due to Newman. Furthermore, we prove some strange congruences modulo 2 for broken 11-diamond partition functions. For example, we prove that if p is a prime with p ≠ 23 and Δ11(2p + 1) ≡ 1 (mod 2), then for any k ≥ 0, Δ11(2p3k+3 + 1) ≡ 1 (mod 2), where Δ11(n) is the number of broken 11-diamond partitions of n.