Skip to content
Journal

Asian Research Journal of Mathematics

Published by SCIENCEDOMAIN international · ISSN (electronic) 2456-477X

Search within this journal

700

Articles indexed

0

2026 articles

700

Open access

2,910

Citations (indexed)

Publications by year

Articles (700)

Bipartite Domination Number of Mycielski Graph of Some Graph Families

Winelyn P. Pelias & Isagani S. Cabahug, Jr. · Asian Research Journal of Mathematics · 2023

For a nontrivial connected graph G, a non-empty set S \(\subseteq\) V (G) is a bipartite dominating set of graph G, if the subgraph G[S] induced by S is bipartite and for every vertex not in S is dominated by any vertex in S. The bipartite domination number denoted by \(\gamma\)b...

Open access Research Article 10.9734/arjom/2023/v19i5658

Fixed Point Theorem for (\(\Phi\), \(\mathfrak{F}\))– Expansive Mappings in Cone b-Metric Spaces over Banach Algebra

R. Jahir Hussain & K. Maheshwaran · Asian Research Journal of Mathematics · 2023

The class functions and are used in this paper to establish the notion of fixed point theorem on expansive mappings. The primary result is a generalization of the fixed point theorem for (\(\Phi\), \(\mathfrak{F}\)) expansive mappings on cone -metric spaces over Banach algebra \(...

Open access Research Article 10.9734/arjom/2023/v19i5656

An Investigation in to the Properties of Functions Defining Distinguished Varieties

U. D. Wijesooriya, Y. G. D. M. Dharmasiri & R. D. P. M. Wijerathne · Asian Research Journal of Mathematics · 2023

An inner toral polynomial is a polynomial in \(\mathbb{C}\) [z,w] such that its zero set is contained in \(\mathbb{D}\)2 \(\cup\) \(\mathbb{T}\)2 \(\cup\) \(\mathbb{E}\)2 where \(\mathbb{D}\) is the open unit disc, \(\mathbb{T}\) is the unit circle and \(\mathbb{E}\) is the exter...

Open access Research Article 10.9734/arjom/2023/v19i5655

On Computational Efficiency of Nine Iterative Algorithms for Hammerstein Equations

Azubuike Weli & Chinedu Nwaigwe · Asian Research Journal of Mathematics · 2023

Many fixed point iterative methods have been proposed. Their authors provide, theoretically, the rate of convergence which indicates how much the error changes after one iteration step. Of practical importance are the CPU time required by each method and their accuracy. This has...

Open access Research Article 10.9734/arjom/2023/v19i5654

A Resilient Adaptive Event-triggered H\(\infty\) Tracking Control of T-S Fuzzy Systems with Markovian Jump Parameters under DOS Attacks

Yuxin Lou & Mengzhuo Luo · Asian Research Journal of Mathematics · 2023

In this paper, the problem of H\(\infty\) output-tracking control for T-S fuzzy markov jump systems(MJSs) with imperfect premise matching is investigated. The conditional probability information between the system and the controller is imperfectly known. Firstly, due to the in in...

Open access Research Article 10.9734/arjom/2023/v19i4653

Laminar Plumes from a Line Source and Their Possible Flow Behaviours

Alabodite Meipre George, Evans Fiebibiseighe Osaisai & Nicholas Dienagha · Asian Research Journal of Mathematics · 2023

Numerical investigation on laminar plumes that under goes buoyancy reversal had just been made, fixing both Re & Pr and varying Fr during the simulations. Water density was taken as a quadratic function of temperature. The result showed some side-to-side apping and bobbing mo...

Open access Research Article 10.9734/arjom/2023/v19i4650

Introducing the Clique-Safe Domination in Graphs

John Mark R. Liwat & Rolito G. Eballe · Asian Research Journal of Mathematics · 2023

Let G = (V (G), E(G)) be any finite, undirected, simple graph. A set D \(\subseteq\) V (G) is introduced in this paper as a clique-safe dominating set of G if D is a dominating set of G and for every clique D\(\prime\)m of size m in the subgraph induced by V (G) \D, there exists...

Open access Research Article 10.9734/arjom/2023/v19i4651

On Rings Domination of Total Graph of Some Graph Families

Kyle Kenneth B. Ruaya & Isagani S. Cabahug, Jr. · Asian Research Journal of Mathematics · 2023

For a nontrivial connected graph G with no isolated vertex, a nonempty subset D \(\subseteq\) V (G) is a rings dominating set if D is a dominating set and for each vertex \(\upsilon\) \(\in\) V \ D is adjacent to at least two vertices in V \ D. Thus, the dominating set D of V (G)...

Open access Research Article 10.9734/arjom/2023/v19i4649