Table of Contents
ISRN Discrete Mathematics
Volume 2014 (2014), Article ID 975812, 5 pages
Research Article

Edge Domination in Some Path and Cycle Related Graphs

1Department of Mathematics, Saurashtra University, Rajkot, Gujarat 360005, India
2Department of Mathematics, A.V. Parekh Technical Institute, Rajkot, Gujarat 360001, India

Received 6 December 2013; Accepted 23 January 2014; Published 13 March 2014

Academic Editors: T. Došlić, H.-J. Kreowski, and U. Vaccaro

Copyright © 2014 S. K. Vaidya and R. M. Pandit. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


For a graph , a subset of is called an edge dominating set of if every edge not in is adjacent to some edge in . The edge domination number of is the minimum cardinality taken over all edge dominating sets of . Here, we determine the edge domination number for shadow graphs, middle graphs, and total graphs of paths and cycles.