Roman edge semi-total block domination of a graph (Q2422074): Difference between revisions

Summary: A graph \(G=(V,E)\), semi-total block graph \(T_b(G)=H\), whose set of vertices is the union of the set of vertices and blocks of \(G\) in whose two vertices are adjacent if and only if the corresponding vertices and blocks of \(G\) are adjacent or the corresponding members are incident. A Roman edge dominating function of a graph \(G=(V,E)\) is a function \(f:E\rightarrow\{0,1,2\}\) satisfying the condition for which \(f(e)=0\) is adjacent to at least to one edge \(h\) for which \(f(h)=2\). The weight of a roman edge dominating function is the value of \(f(E)=\sum_{e\in E}f(e)\). The Roman edge domination number of a graph \(G\) denoted by \(\gamma_{\mathrm{re}}(G)\), equals the minimum weight of a roman edge dominating function of \(G\). A roman edge dominating function of a graph \(H\) is a roman semi-total block dominating function if \(g:w\rightarrow\{0,1,2\}\) satisfying the condition for which \(g(e)=0\) is adjacent to at least to one edge \(h\) for which \(g(h)=2\). The weight of a roman edge semi-total block dominating function is the value of \(g(w)=\sum_{e\in w}g(e)\). The Roman edge semi-total block domination number of a graph \(G\) denoted by \(\gamma_{\mathrm{re}}(T_b(G))\), equals the minimum weight of a roman edge semi-total block dominating function of \(G\). In this paper we study the graph theoretic properties of this variant of the domination number \(H=T_b(G)\) and obtained many bounds of it in terms of its original graph \(G\).