%0 Journal Article %T Total perfect codes‎, ‎OO-irredundant and total subdivision in graphs %J Bulletin of the Iranian Mathematical Society %I Iranian Mathematical Society (IMS) %Z 1017-060X %A Hosseinzadeh, H. %A Soltankhah, N. %D 2016 %\ 06/01/2016 %V 42 %N 3 %P 499-506 %! Total perfect codes‎, ‎OO-irredundant and total subdivision in graphs %K Total domination number %K OO‎- ‎irredundance number‎ %K total subdivision number %R %X ‎Let $G=(V(G),E(G))$ be a graph‎, ‎$\gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$‎, ‎respectively‎. ‎A total dominating set $S$ of $G$ is called a $\textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$‎. ‎In this paper‎, ‎we show that if $G$ has a total perfect code‎, ‎then $\gamma_t(G)=ooir(G)$‎. ‎As a consequence, we determine the value of $ooir(G)$ for some classes of graphs‎. %U http://bims.iranjournals.ir/article_778_fa2994302d0b573b33b69934d84dde37.pdf