Double Edge-Vertex Domination on Middle and Splitting Graphs of Path and Cycle

Authors : Banu AYLI, Elgin KILIC

Pages : 221-231

Doi:10.33401/fujma.916263

View : 20 | Download : 9

Publication Date : 2021-12-01

Article Type : Research Paper

Abstract :An edge $e=uv$ of graph $G=insert ignore into journalissuearticles values(V,E);$ is said to be edge-vertex dominate vertices $u$ and $v$, as well as all vertices adjacent to $u$ and $v$. A set $S \subseteq E $ is 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 by $\gamma_{dev}insert ignore into journalissuearticles values(G);$. In this paper, we present results for middle graphs of path and cycle and some splitting graphs of path and cycle on double edge-vertex domination numbers.
Keywords : Double edge vertex dominating set, Double vertex edge dominating set, Edge vertex dominating set, Vertex edge dominating set