This article presents a new approach to address the resolution of homogeneous linear recurrences of higher order and interpolation problems. By establishing an explicit formula for the entries of the inverse of generalized Vandermonde matrices, a fresh perspective on these mathe...
Open access
Research Article10.9734/arjom/2023/v19i9718
In this paper, a modified Adomian decomposition method (MADM) for solving the hyperbolic telegraph equation is proposed. The MADM introduces a new inverse partial differential operator that can speed up the convergence rate of the standard ADM. We also present a technique for con...
Open access
Research Article10.9734/arjom/2023/v19i9719
For a connected nontrivial graph G, the maximum linear forest of G is the linear forest having maximum number of edges. The number of edges in a maximum linear forest is denoted by \(\ell\)`(G). In this paper we determine the maximum linear forest of the join and union of nontri...
Open access
Research Article10.9734/arjom/2023/v19i10720
Sequel to the trend of the epileptic nature of electricity power supply in some part of the country, this paper provides a maintainability model for this problem in Uyo. Different statistical test were employed in the work. The data was subjected to both descriptive and inferenti...
Open access
Research Article10.9734/arjom/2023/v19i9716
Let G = (V (G),E (G)) be any finite, undirected, simple graph. The clique centrality of a vertex \(\mathit{x}\) \(\in\) V (G), denoted by \(\omega\)G (\(\mathit{x}\)), is the maximum size of a clique in G containing \(\mathit{x}\). A set D \(\subseteq\) V (G) is introduced in thi...
Open access
Research Article10.9734/arjom/2023/v19i9717
For any graphs G of order n, the spanning tree packing number, denoted by, of a graph G is the maximum number of edge disjoint spanning tree contained in G. In this study determine the spanning packing number of lexicographic product of graphs resulting from two path graphs.
Open access
Research Article10.9734/arjom/2023/v19i9710
In this paper, a new distribution known as the Shifted Chris-Jerry (SHCJ) distribution is proposed. The proposition is motivated by the need to compare the efficiency of various classical estimation methods as well as the bayesian estimation using gamma prior at linear-exponentia...
Open access
Research Article10.9734/arjom/2023/v19i9711
The minimum value of f is the 2-rainbow domination number denoted by γr2(G).In this study, we determine the 2-rainbow domination number of some special classes of graphs over its corresponding γ-set, specifically, path, cycle, fan, and wheel graphs.
Open access
Research Article10.9734/arjom/2023/v19i9712
This paper, we extends the new concept of common fixed point theorems in C*-algebra valued b-metric space (AV BMS) via (\(\mathfrak{F}\); \(\phi\)) - contractive mappings. Investigated are the common fixed points criteria for existence and uniqueness. Additionally, provide an ill...
Open access
Research Article10.9734/arjom/2023/v19i9713
For any graph G, the spanning tree packing number of \(\sigma\) (G), is the maximum number of edge-disjoint spanning trees contained in G. In this study, we determined the maximum number of edge-disjoint spanning trees of the generalized petersen graph and cocktail graph.
Open access
Research Article10.9734/arjom/2023/v19i9714
For a graph G = (V, E) of order K2 the minimum superior eccentric dominating energy SEed(G) is the sum of the eigen values obtained from the minimum superior eccentric dominating K x K matrix Ased (G) = (Seij) In this paper SEed(G) of standard graphs are computed. Properties, up...
Open access
Research Article10.9734/arjom/2023/v19i9715
Iterative methods provide hope for many nonlinear engineering problems that cannot be solved through analytic procedures. In this article, orthogonal polynomial based iterative schemes are developed for the approximate solutions of nonlinear algebraic and transcendental equations...
Open access
Research Article10.9734/arjom/2023/v19i9708
In this article, we have combined two well known third order methods one is Chebyshev and another is Super- Halley to form an iterative method of third for solving polynomial equations with multiple polynomial zeros. This constructed method is basically the mean of the methods Ch...
Open access
Research Article10.9734/arjom/2023/v19i9709
In this study, we present fixed-point results for various contractions in E - Metric Space along with several corollaries. Finding a fixed point result in E - Metric Space can also be done via implicit relations. In the investigation of our primary result stands, all the theorems...
Open access
Research Article10.9734/arjom/2023/v19i9707
Bipolar intuitionistic fuzzy graphs (BIFG) with perfectly connected domination are introduced in this study. The study also discusses the bipolar intuitionistic antifuzzy graphs (BIAFG) domination concepts. Additionally, the topic of 2-domination in BIAFG are explored. we develop...
Open access
Research Article10.9734/arjom/2023/v19i9704