TY - JOUR
ID - 578
TI - Domination number of graph fractional powers
JO - Bulletin of the Iranian Mathematical Society
JA - BIMS
LA - en
SN - 1017-060X
AU - Iradmusa, M. N.
AD - Shahid Beheshti University
Y1 - 2014
PY - 2014
VL - 40
IS - 6
SP - 1479
EP - 1489
KW - Domination number
KW - Subdivision of a graph
KW - Power of a graph
DO -
N2 - 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.
UR - http://bims.iranjournals.ir/article_578.html
L1 - http://bims.iranjournals.ir/article_578_75c4cbe02b1125c194ec33ac260ea658.pdf
ER -