The paper is about strong edge cover of the graph. The edge set of the graph is a strong edge cover if all the pendent edges belong to the edge set and among the non pendent edges if two distinct edges are adjacent then one edge must belong to the edge set. It is proved that every strong edge cover is an edge cover but the converse need not be true. The characterization of a minimal strong edge cover is given. The relation between strong edge cover and edge H-domination is discussed. The effect of vertex (edge) removal operation on strong edge covering number of the graph is observed.