All Title Author
Keywords Abstract

Neighborhood connected edge domination in graphs

DOI: 10.5556/j.tkjm.43.2012.69-80

Keywords: Neighborhood Connected Domination , Neighborhood Connected Edge Domination

Full-Text   Cite this paper   Add to My Lib


Let G = (V,E) be a connected graph. An edge dominating set X of G is called a neighborhood connected edge dominating set (nced-set) if the edge induced subgraph < N(X) > is connected. The minimum cardinality of a nced-set of G is called the neighborhood connected edge domination number of G and is denoted by. In this paper we initiate a study of this parameter.


comments powered by Disqus

Contact Us


微信:OALib Journal