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 , wher...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.展开更多
文摘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.