Journal of the Indonesian Mathematical Society

ANALYSIS OF UNEMPLOYED YOUTH IN INDONESIA BY PANEL DATA REGRESSION WITH MODERATING VARIABLE

Sri Subanti — 2024-09-18

Indonesia is entering the era of demographic bonus with the productive age dominating the population. Productive age is the main focus of the government in maximizing the demographic dividend, but Indonesia has the highest percentage of Not in employment, education or training (NEET) in Asia. NEET are people on 15 â 24 years old who do other activities outside of school, work or training. This study aims to analyze NEET in Indonesia using panel data with moderate regression analysis. The analysis of multiple linear regression is focused on the relationship between the independent and dependent variables without taking into other possible outcomes. By inserting a moderating variable, this study explores the relationship between the independent and dependent variables differently and aims to strengthen or weaken it. Under certain conditions, the relationship between the independent and dependent variables can be explained by the moderating variable. The research data used were obtained from the employment book and the website of BPS Indonesia, in the form of 34 cross section and 5 years time series data that tends to be stationary. The dependent variable is NEET with 5 independent variables including Human development index, the open unemployment rate, labor force participation rate, proportion of individuals who own phone, and proportion of informal employment. The moderating variable is the proportion of youth aged with ICT skills. The best model in regression analysis panel data is FEM with 4 significant independent variables and 92.75% of R-square. Moderating variable can moderates the relationship of NEET with its independent variables and increased the R-square to 94.19%.

FIXED POINT THEOREMS FOR (ψ, ϕ, ω)-WEAK CONTRACTIONS IN COMPLETE METRIC SPACES

Irvandi Gorby Pasangka — 2024-09-23

In this paper, we define the mapping called (ψ, ϕ, ω)-weak contractions. We then use this definition to proof the existence of fixed point. The mapping we defined above is a modified mapping by Liu and Chai. We use the concept ω-distance to proof the fixed point theorem. Since every ω-distance is metric, then the resulting theorem also satisfy for every metric.

A NEW THREE- STEP DERIVATIVE FREE ITERATIVE METHOD AND ITS DYNAMICS

Syamsudhuha Syamsudhuha — 2024-09-23

A new free derivative iterative method is presented in this article. The method is developed by combining Newton’s method and Euler’s method. Deriva- tives in this method are approximated by forward difference, hyperbola and divided difference. The order of convergence is proven analytically to be of sixth order. Numerical results exhibit that the new method is comparable to other methods. Basins of attraction are also provided to support the proposed method.

GROUP MEAN CORDIAL LABELING OF SOME QUADRILATERAL SNAKE GRAPHS

Rajalekshmi R N — 2024-11-08

Let G be a (p, q) graph and let A be a group. Let f : V (G) −→ A be a map. For each edge uv assign the label [o(f (u))+o(f (v)) / 2]. Here o(f (u)) denotes the order of f (u) as an element of the group A. Let I be the set of all integers
labeled by the edges of G. f is called a group mean cordial labeling if the following conditions hold: (1) For x, y ∈ A, |vf (x) − vf (y)| ≤ 1, where vf (x) is the number of vertices labeled with x. (2) For i, j ∈ I, |ef (i) − ef (j)| ≤ 1, where ef (i) denote the number of edges labeled with i. A graph with a group mean cordial labeling is called a group mean cordial graph. In this paper, we take A as the group of fourth roots of unity and prove that, Quadrilateral Snake, Double Quadrilateral Snake, Alternate Quadrilateral Snake and Alternate Double Quadrilateral Snake are group
mean cordial graphs.

ABUSE OF PSYCHOACTIVE DRUGS AND ITS PREVENTION IN A HOST COMMUNITY: MATHEMATICAL ANALYSIS

S.E. Fadugba — 2024-11-08

In this paper, psychoactive drug abuse and prevention in a host community is illustrated by a mathematical model, studying the human population into four groups: those who are at risk of being initiated into psychoactive drug abuse, those who are currently abusing psychoactive drugs, those who are undergoing treatment for psychoactive drug abuse, and those who give up drug abuse through willingness or therapy. The positivity and invariant region of the model are investigated. The basic reproduction number $R_drg$ was also obtained. The numerical simulations were performed using the computer software MATLAB. The dynamics of variables and the sensitivity of parameters are displayed graphically to demonstrate that treatment and willingness to stop drug abuse are effective ways to reduce the threat of psychoactive drug abuse in a host community.

LIGHTLIKE HYPERSURFACES OF AN INDEFINITE (α, β)-TYPE ALMOST CONTACT METRIC STATISTICAL MANIFOLD WITH AN (l, m)-TYPE CONNECTION

Shagun Bhatti — 2024-11-20

This paper aims to present the theory of hypersurfaces for a novel class of manifolds called an indefinite (α, β)-type almost contact metric statistical manifold or trans-Sasakian statistical manifold with an (l, m)-type connection. The study delves into the analysis of screen semi-invariant lightlike hypersurfaces within this framework. Specific conditions on the recurrent and Lie recurrent structure tensor field have been established. Additionally, illustrative examples are provided to enhance the comprehension of the introduced concept.

COMMUTATIVE AND SPECTRAL PROPERTIES OF kth-ORDER (SLANT TOEPLITZ + SLANT HANKEL) OPERATORS ON THE POLYDISK

M. P. Singh — 2024-11-20

In this paper for k ≥2, we introduce the idea of kth-order (Slant Toeplitz + Slant Hankel ) operators on the polydisk and discuss the commutativity, partial isometry and co-isometry properties. Further, we extend our study to the spectral properties.

ON X-SUB-LINEARLY INDEPENDENT OF ROUGH GROUPS

Gusti Ayu Dwi Yanti — 2024-11-26

In 1982, Pawlak introduced a concept, namely the rough set theory. Several studies have been conducted regarding applying rough set theory in algebraic structures such as rough groups, rough rings, and rough modules. Furthermore, X-sub-linearly independent is a generalization of linearly independent concepts. In this paper, we investigate the X-sub-linearly independent of rough groups.

UNVEILING THE RELATIONSHIP BETWEEN M-POLYNOMIAL BASED TOPOLOGICAL INDICES AND INVERSE GRAPHS OF FINITE CYCLIC GROUPS: A COMPREHENSIVE STUDY

Mageshwaran K — 2024-12-03

In the discipline of graph theory, topological indices are extremely important. The M-polynomial is a powerful tool for determining a graph's topological indices. The use of M-polynomials to describe macro-molecules and biochemical networking is a novel concept. Also, the M-polynomial of various micro-structural allows us to calculate a variety of topological indices. The chemical substances and biochemical networks are correlated with their chemical characteristics and bio-active compounds using these findings. In this research, we use the M-polynomial to create special essential topological indices of inverse graphs on finite cyclic groups, such as Randic, Zagreb, Augmented Zagreb, Harmonic, Inverse sum, and Symmetric division degree indices.

BALANCED INDEX SETS OF GRAPHS AND SEMIGRAPHS

Nagarjun Prabhu — 2024-12-07

Let G be a simple graph with vertex set V (G) and edge set E(G). Graph labeling is an assignment of integers to the vertices or the edges, or both, subject to certain conditions. For a graph G(V, E), a friendly labeling f : V (G) → {0, 1} is a binary mapping such that |vf (1) − vf (0)| ≤ 1, where vf (1) and vf (0) represents number of vertices labeled by 1 and 0 respectively. A partial edge labeling f ∗ of G is a labeling of edges such that, an edge uv ∈ E(G) is, f ∗(uv) = 0 if f (u) = f (v) = 0; f ∗(uv) = 1 if f (u) = f (v) = 1 and if f (u)̸ = f (v) then uv is not labeled by f ∗. A graph G is said to be balanced graph if it admits a vertex labeling f that satisfies the conditions, |vf (1) − vf (0)| ≤ 1 and |ef (1) − ef (0)| ≤ 1, where ef (0), ef (1) are the number of edges labeled with 0 and 1 respectively. The balanced index set of the graph G is defined as, {|ef (1) − ef (0)| : the vertex labeling f is friendly}. A semigraph is a generalization of graph. The concept of semigraph was introduced by E. Sampath Kumar. Frank Harrary has defined an edge as a 2-tuple (a, b) of vertices of a graph satisfying, two edges (a, b) and (a′, b′) are equal if and only if either a = a′ and b = b′ or a = b′ and b = a′. Using this notion, E. Sampath Kumar defined semigraph as a pair (V, X) where V is a non-empty set whose elements are called vertices of G and X is a set of n-tuples called edges of G of distinct vertices, for various n ≥ 2 satisfying the conditions: (i) Any two edges of G can have at most one vertex in common; and (ii) two edges (a1, a2, a3, ..., ap) and (b1, b2, b3, ..., bq ) are said to be equal if and only if the number of vertices in both edges must be equal, i.e p = q, and either ai = bi for 1 ≤ i ≤ p or ai = bp−i+1, 1 ≤ i ≤ p. In this article, balance index set of T (Pn), T (Wn), T (Km,n) and T (Sn) determined, and the balance index set of semigraph is introduced. Additionally, the balanced index set of semigraph Cn,m, Kn,m is determined.