Let G =(V,E) be a graph. A subset X of E is called an edge dominating set of G if every edge in E - X is adjacent to some edge in X . An edge dominating set which intersects every maximum matching inG is called matching transversal edge dominating set. The minimum cardinality of a matching transversal edge dominating set is called the matching transversal edge domination number of G and is denoted by γmt(G). In this paper, we begin an investigation of this parameter.
Matching Transversal Edge Domination in Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 11,
2, Article 28.
Available at: https://digitalcommons.pvamu.edu/aam/vol11/iss2/28