Naseam Al-Kuleab

The Caputo fractional-order differential operator is used in epidemiological models, but its accuracy benefits are typically ignored. We validated the suggested fractional epidemiological seasonal influenza model of the SVEIHR type to demonstrate the Caputo operator’s relevance. We analysed the model using fractional calculus, revealing its basic p...

The main purpose of this paper is to present a new characterization of cyclic groups using only undergraduate-level group theory.

We determine the Dedekind domain pairs of rings; that is, pairs of rings R⊂S such that each intermediary ring in between R and S is a Dedekind domain. We also establish that if R⊂S is an extension of rings having only one non-Dedekind intermediary ring, then necessarily R is not Dedekind and so R is a maximal non-Dedekind domain subring of S. Maxim...

كتاب تدريسي

The commutative ring extensions with exactly two non-Artinian intermediate rings are characterized. An initial step involves the description of the commutative ring extensions with only one non-Artinian intermediate ring. 1. Introduction All rings and algebras considered in this paper are assumed to be commutative with the identity element; all su...

A commutative ring R is said to be maximal non-prime ideally equal subring of S, if Spec(R) \(\ne \) Spec(S), whereas Spec(T) \(=\) Spec(S) for any subring T of S properly containing R. The aim of this paper is to give a complete characterization of this class of rings.

Hovey [11] called a graph G is A- cordial where A is an additive Abelian group and f: V(G) → A is a labeling of the vertices of G with elements of A such that when the edges of G are labeled by the induced labeling f : E(G) → A by f∗(xy) = f(x) + f(y) then the number of vertices (resp. edges) labeled with a and the number of vertices (resp. edges)...

In this paper, we determine which graphs in certain families are 3-equitable.

Suppose G is a graph with vertex set V(G) and edge set E(G), and let A be an additive Abelian group. A vertex labeling f:V(G)→A induces an edge labeling f * :E(G)→A defined by f * (xy)=f(x)+f(y). For a∈A, let n a (f) and m a (f) be the number of vertices v and edges e with f(v)=a and f * (e)=a, respectively. A graph G is A-cordial if there exists a...