Neighborhood connected edge domination in graphs

Article Sidebar

PDF Graph 01 Graph 02 Graph 03 Graph 04
Published: Mar 31, 2012
DOI: https://doi.org/10.5556/j.tkjm.43.2012.710
Keywords:
Neighborhood Connected Domination Neighborhood Connected Edge Domination

Main Article Content

Kulandaivel M.P.
Department ofMathematics, St. Joseph’s College of Engineering, Chennai-600119, India.
C. Sivagnanam
School of Sciences, Birla Institute of Technology, Kingdom of Bahrain.
P. Selvaraju
Department ofMathematics, SSN College of Engineering, Chennai-603110, India.

Abstract

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.

Article Details

How to Cite
M.P., K., Sivagnanam, C., & Selvaraju, P. (2012). Neighborhood connected edge domination in graphs. Tamkang Journal of Mathematics, 43(1), 69–80. https://doi.org/10.5556/j.tkjm.43.2012.710
Issue
Vol. 43 No. 1 (2012)
Section
Papers

References

S. Arumugam and C. Sivagnanam, Neighborhood connected domination in graphs, J. Combin. Math. Combin. Comput. 73 (2010), 55-64.

S. Arumugam and S. Velammal, Connected edge domination in graphs, Bulletin of Allahabad Mathematical Society, 24 (1)(2009), 43-49.

G. Chartrand and L. Lesniak, Graphs and Digraphs, CRC, (2005).

T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, (1997).

T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs-Advanced Topics, Marcel Dekker, Inc., New York, (1997).

S.R. Jayaram, Line domination in graphs, Graphs Combin. 3 (1987), 357-363.

S.Mitchell and S.T.Hedetniemi, Edge domination in trees, Congr. Numer. 19 (1977), 489-509.