Let â„› be a commutative ring with unity and let ℬ be a unitary R-module. Let ℵ be a proper submodule of ℬ, ℵ is called semisecond submodule if for any r∈ℛ, r≠0, n∈Z_+, either rⁿℵ=0 or rⁿℵ=rℵ.

In this work, we introduce the concept of semisecond submodule and confer numerous properties concerning with this notion. Also we study semisecond modules as a popularization of second modules, where an ℛ-module ℬ is called semisecond, if ℬ is semisecond submodul of ℬ.

     In this work, we introduce  a new convergence formula. We also define cluster point , δ-Cauchy sequence, δ-convergent, δ-completeness , and define sequentially contraction  in approach space. In addition, we prove the contraction condition is necessary and sufficient to get the  function is sequentially contraction  as well as we put a new structure for the norm in the approach space which is called approach –Banach space, we discuss the normed approach space with uniform condition is a Hausdorff space. Also, we prove a normed approach space is complete if and only if the metric generated from approach space is complete as well as prove every finite –dimensional approach normed space is δ-complete. We prove several r

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

The topological indices are functions on the graph that do not depend on the labeling of their vertices. They are used by chemists for studying the properties of chemical compounds.  Let  be a simple connected graph. The Hyper-Zagreb index of the graph ,  is defined as  ,where  and  are the degrees of vertex  and , respectively. In this paper, we study the Hyper-Zagreb index and give upper and lower bounds for .

This booklet contains the basic data and graphs forCOVID-19 in Iraq during the first three months of thepandemic ( 24 February to 19 May - 2020 ) , It isperformed to help researchers regarding this health problem (PDF) Information Booklet COVID-19 Graphs For Iraq First 3 Months. Available from: https://www.researchgate.net/publication/341655944_Information_Booklet_COVID-19_Graphs_For_Iraq_First_3_Months#fullTextFileContent [accessed Oct 26 2024].

In this paper, Nordhaus-Gaddum type relations on open support independence number of some derived graphs of path related graphs under addition and multiplication are studied.