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 ...

The domination number of graph is the smallest cardinality set G. A subset a vertex S G called if every element dominates G, meaning that not an connected and one distance from S. has become interesting research studies on several graphs k -connected such as circulant graphs, grids, wheels. This study aims to determine other k-connected Harary graph. method used pattern detection axiomatic dedu...