TITLE:
Signed (b,k)-Edge Covers in Graphs
AUTHORS:
A. N. Ghameshlou, A. Khodkar, R. Saei, S.M. Sheikholeslami
KEYWORDS:
Signed Star Dominating Function, Signed Star Domination Number, Signed -edge Cover, Signed -edge Cover Number
JOURNAL NAME:
Intelligent Information Management,
Vol.2 No.2,
March
16,
2010
ABSTRACT: 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.