In this paper, we deals about exact double domination in graphs. In a graph a vertex is said to dominate itself and all its neighbours. A double dominating set is exact if every vertex of G is dominated exactly twice. If a double dominating set exist then all such sets have the same size and bounds on this size. We established a necessary and sufficient condition of exact double dominating set in a connected cubic graph with application.