@article {
author = {Iradmusa, M. N.},
title = {Domination number of graph fractional powers},
journal = {Bulletin of the Iranian Mathematical Society},
volume = {40},
number = {6},
pages = {1479-1489},
year = {2014},
publisher = {Iranian Mathematical Society (IMS)},
issn = {1017-060X},
eissn = {1735-8515},
doi = {},
abstract = {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.},
keywords = {Domination number,Subdivision of a graph,Power of a graph},
url = {http://bims.iranjournals.ir/article_578.html},
eprint = {http://bims.iranjournals.ir/article_578_75c4cbe02b1125c194ec33ac260ea658.pdf}
}