Edge Domination in Some Path and Cycle Related Graphs. (13th March 2014)

• Record Type: Journal Article
• Authors: Vaidya, S. K.; Pandit, R. M.
• Other Names: Došlić T. Academic Editor.; Kreowski H.-J. Academic Editor.; Vaccaro U. Academic Editor.
• Is Part Of: ISRN discrete mathematics. Volume 2014(2014)
• Publication Date: 2014-03-13
• Subjects: Discrete mathematics -- Periodicals; Computer science -- Mathematics; Computer science -- Mathematics; Periodicals; 511.1
• DOI: 10.1155/2014/975812
• Languages: English
• ISSNs: 2090-7788

Abstract

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