• THE NEIGHBORHOOD TOTAL EDGE DOMINATION NUMBER OF A GRAPH
Abstract
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.
Keywords
Full Text:
pdfRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2011-2024 Research Journal of Pure Algebra (RJPA) Copyright Agreement & Authorship Responsibility | Counter |