DOUBLE EDGE-VERTEX DOMINATION NUMBER OF GRAPHS
Articles > Article · 2020
Authors: Elgin KILIÇ, Banu Aylı
Advanced Mathematical Models & Applications, Refereed Journals of Other Institutions, International, EBSCO, 2020, vol 5, pp 19-37
Summary
<p>An edge e = uv of graph G = (V, E) is said to edge-vertex dominate vertices u and v as well as all vertices adjacent to u and v. A set S ? E is called a double edge-vertex dominating set, if every vertex of V is edge-vertex dominated by at least two edges of S. The minimum cardinality of a double edge-vertex dominating set of G is the double edge-vertex domination number and is denoted ?dev(G). In this paper, we define double edge-vertex domination. Then we derive formulas for some special classes of graphs on double edge-vertex domination number. <br></p>