Let $G = (V, E)$ be a graph, for any edge $f \in E_{SG}$, the edge of $f \in uv$ in $SG$ is defined $\deg f = \deg u + \deg v - 2$. A set $F_e \subseteq E[SG]$ is equitable edge dominating set of $SG$ if every edge $f$ not in $F_e'$ is adjacent to at least one edge $f' \in F_e'$ such that $\deg f - \deg(f') \le 1$. The minimum cardinality of such dominating set is called edge equitable domination number of $SG$ denoted by $\gamma_{ec}'(S)$. The set $F_e'$ is said to be a edge equitable connected dominating set of $SG$, if the induced subgraph $F_e'$ is connected and is denoted by $\gamma_{ecs}'(G)$. In this paper we introduce many bounds for $\gamma_{ecs}'(G)$ and its exact values for some standard graphs are produced.