Total Roman domination subdivision number in graphs
A {\em Roman dominating function} on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {\em total Roman dominating function} is a Roman dominating function with the ad...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Azarbaijan Shahide Madani University
2020-12-01
|
| Series: | Communications in Combinatorics and Optimization |
| Online Access: | http://comb-opt.azaruniv.ac.ir/article_13997_361f34d42a9e4c4eeb3798140a18ae6f.pdf |