Given a graph G = (V (G),E(G)), a nonempty set S \(\subseteq\) V (G) of fixed cardinality \(\gamma\)(G) - k is called a \(\zeta\)k - set of G, where 1 \(\le\) k \(\le\) \(\gamma\)(G) -1, if S gives the minimum cardinality |V (G) \ NG[S]| for all the possible subsets of V (G), eac...
Open access
Research Article10.9734/arjom/2022/v18i12628
This paper sort to establish some risk factors of stroke and to estimate the effect of the covariates at different levels of disease states. A review of the literature on stroke risk factors did not reveal any article that estimate possible covariate effect of transition. To fill...
Open access
Research Article10.9734/arjom/2022/v18i12627
The classical assignment problems cannot be successfully used for the real-world situation it is because the work efficiency varies to some extent from person to person hence, the use of fuzzy assignment problems is more appropriate. Based on the performance of the previous recor...
Open access
Research Article10.9734/arjom/2022/v18i12626
In this paper, some important properties concerning the Hilfer-type fractional derivative are discussed. Integral transforms for these operators are derived as particular cases of the Jafari transform, Mellin transform and Fourier transform. These integral transforms are used to...
Open access
Research Article10.9734/arjom/2022/v18i12625
The preference of the proper distribution for modelling data is often a substantial concern to researchers and practitioners. For this reason, new statistical distributions or the generalizations of well-known distributions have been proposed for exible modeling. Weighted distrib...
Open access
Research Article10.9734/arjom/2022/v18i12623
Aims/ Objectives: The concept of topological group is a simple combination of the concepts of abstract group and topological space. The purpose of this paper is to combine the concepts of topological space and near groups to dene topological near groups on an nearness approximati...
Open access
Research Article10.9734/arjom/2022/v18i12624
For a nontrivial connected graph \(G\) with no isolated vertex, a nonempty subset \(D \subseteq V(G)\) is a rings dominating set if each vertex \(v \in V-D\) is adjacent to at least two vertices in \(V-D\). Thus, the dominating set \(D\) of \(V(G)\) is a rings dominating set if f...
Open access
Research Article10.9734/arjom/2022/v18i12622
A set S of a graph G = (V (G);E(G)) is a rings dominating set if S is a dominating set and for every vertex in the complement of S has atleast two adjacent vertices. The caridinality of the minimum rings dominating set is the rings domination number of graph G, denoted by \(\gamm...
Open access
Research Article10.9734/arjom/2022/v18i12621
New results for stability and feedback control of time delay systems were proposed. These results were obtained by using Lyapunov Razumikhin method to approximate the stability of the uncontrolled Volterra type system with delay and designing a state feedback controller using a m...
Open access
Research Article10.9734/arjom/2022/v18i12620
Computing the inverse of 3 x 3 square matrices using known methods such as Gauss-Jordon Method needs more time. During examination, candidates need to go through long process to find the inverse of 3 x 3 square matrices. Some students also find it very difficult and confusing whe...
Open access
Research Article10.9734/arjom/2022/v18i11618