%0 Journal Article
%T Domination number of graph fractional powers
%J Bulletin of the Iranian Mathematical Society
%I Iranian Mathematical Society (IMS)
%Z 1017-060X
%A Iradmusa, M. N.
%D 2014
%\ 12/01/2014
%V 40
%N 6
%P 1479-1489
%! Domination number of graph fractional powers
%K Domination number
%K Subdivision of a graph
%K Power of a graph
%R
%X For any $k \in \mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by $G^{\frac{m}{n}}$. In this regard, we investigate domination number and independent domination number of fractional powers of graphs.
%U http://bims.iranjournals.ir/article_578_75c4cbe02b1125c194ec33ac260ea658.pdf