Open Access Open Access  Restricted Access Subscription Access
Cover Image

(1,2) – Edge Domination in Cycle and Path Related Graphs

V. Mohanaselvi, K. Deiwakumari


The domination is a well known factor in graph theory, in which the distance between two vertices is one of the essential tool to measure various domination parameters. The (1,2) – domination for simple graphs was introduced by N. Murugesan and Deepa.S.Nair in the year 2012. Followed that we introduced the edge analogue of the above parameter. In this paper, we obtained the (1,2) – edge domination number for cycle and path related graphs and characterized this parameter.

Full Text:



  • There are currently no refbacks.