IJPAM: Volume 41, No. 4 (2007)
Department of Mathematics
Shanghai, 200444, P.R. CHINA
Abstract.Let be a connected graph with vertex set and edge set . A signed total edge dominating function of is a function such that for every , where is the edge neighborhood of an edge . The signed total edge domination number of is the minimum weight of a signed total edge dominating function on . In this paper we present some lower bounds on the signed total edge domination number of a graph and find some exact values on when is a complete graph, a complete bipartite graph, the grid or the grid .
Received: July 1, 2007
AMS Subject Classification: 05C69
Key Words and Phrases: signed total edge domination number, signed total edge dominating function
Source: International Journal of Pure and Applied Mathematics