Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 11 4 2026 12 01 A note on the domination number in bipartite graphs 1215 1219 15147 10.22049/cco.2026.31447.2855 EN Nader Jafari Rad Department of Mathematics, Shahed University, Tehran, Iran Journal Article 2026 01 01 ‎Archdeacon et al. [J. Graph Theory 46 (2004), 207--210] proved that if $G$ is a bipartite graph with partite sets $X$ and $Y$ whose vertices in $Y$ are of minimum degree at least $3$ then there exists a set $A\subseteq X$ of size at most<br />$\frac{|X\cup Y|}{4}$ such that every vertex in $Y$ is adjacent to a vertex in $A$. We generalize this result for all bipartite graphs with minimum degree $\delta\geq 3$ using the Brooks Theorem on the vertex coloring. https://comb-opt.azaruniv.ac.ir/article_15147_9f617b1b10337f51265d1ac407e11d02.pdf