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 paper is devoted to solution of some problems in nuclear power station generating unit intellectual control systems using genetic algorithms on the basis of control system model development, optimizations methods of their direct quality indices and improved integral quadratic estimates. some mathematical vector models were obtained for control system multicriterion quality indices with due ...

In this paper, an extension of the power half-normal (PHN) distribution is introduced. This new model built on application slash methodology for positive random variables. The result a with greater kurtosis than PHN; i.e., its right tail heavier PHN distribution. Its probability density, survival and hazard rate function are studied, moments, skewness coefficientes obtained, along relevant prop...

we prove that each normal automorphism of the $n$-periodic product of cyclic groups of odd order $rge1003$ is inner, whenever $r$ divides $n$.

There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive normal form Boolean expressions to establish a proper hierarchy for finite languages, where the language of an expression is defined to be the set of bit strings corresponding to its satisfying assignments. The increasing r...

A numerical investigation was carried out to solve the flow dimensionless partial differential equations through rectangular microchannels. A purely viscous power law <span style="font-size: 10pt; colo...