Author(s)

A. N. Ghameshlou, A. Khodkar, R. Saei, S.M. Sheikholeslami

.

Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least vertices of , where . The value , taking over all signed -edge covers of is called the signed -edge cover number of and denoted by . In this paper we give some bounds on the signed -edge cover number of graphs.

Signed Star Dominating Function, Signed Star Domination Number, Signed -edge Cover, Signed -edge Cover Number

A. Ghameshlou, A. Khodkar, R. Saei and S. Sheikholeslami, "Signed (b,k)-Edge Covers in Graphs," Intelligent Information Management, Vol. 2 No. 2, 2010, pp. 143-148. doi: 10.4236/iim.2010.22017.