A subset S of vertices of a simple graph G is called a binary dominating set of G if the closed neighborhood of S equals the vertex set V(G), and each vertex in S has at most one neighbor within S. The minimum cardinality of a binary dominating set is called the binary domination number of G, denoted γ01(G). In this paper, we establish sharp bounds for the binary domination number and characterize graphs attaining these bounds. We prove that for any positive integers a, b, and c satisfying a≤b≤c, there exists a connected graph G such that γ(G)=a,γ_01 (G)=b,"and" γ_i (G)=c. Characterizations of the binary domination number for the join and corona products are also established. Additional findings on paths, cycles, and the relationship between binary domination and independent domination are presented.