Let G = (V, E) be a graph without isolated vertices and isolated edges. An edge dominating set F of G is called a neighborhood total edge dominating set if the edge induced subgraph áN(F)? has no isolated edges. The neighborhood total edge domination number g'nt(G) of G is the minimum cardinality of neighborhood total edge dominating set of G. In this paper, we initiate a study of this new parameter.
展开▼
