This paper investigates the independent 2-domination polynomial of complete bipartite graphs Km, n. We establish closed formulas for this polynomial and describe all independent 2-dominating sets in such graphs. The findings illustrate how the bipartite structure determines the enumeration of these sets and provide further insight into domination-type polynomials in special graph families.