Covering the Corona of Graphs With Optimal Collection of Edges

Let G be a simple graph. A subset U of E(G) is an edge cover of G if every vertex in G is incident with an edge in U. The minimum cardinality of an edge cover of G is called the edge covering number of G. In this paper, we established an upper bound for the edge covering number of graphs resulting from the corona of two connected graphs in terms of the edge covering numbers of the graphs in consideration.