Meryta Febrilian Fatimah
Mathematics Study Program, Faculty Of Mathematics And Natural Sciences, Universitas Sulawesi Barat

Published : 12 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 12 Documents
Search

Numerical Approach for Solving Fractional Integral Equations using Fixed-point Iterative Scheme Ahmad Ansar; Meryta Febrilian Fatimah; Rini Renggawati
Journal of Mathematics, Computations and Statistics Vol. 8 No. 1 (2025): Volume 08 Nomor 01 (April 2025)
Publisher : Jurusan Matematika FMIPA UNM

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35580/jmathcos.v8i1.6859

Abstract

This paper is aimed to solve fractional integral equations using fixed point iterative approach. We used D-plus iteration process with nonexpansive mapping in uniformly convex Banach spaces. We start by prove weak and strong convergence theorems related for nonexpansive mapping and compare convergence rate of some iterative scheme through numerical example. Furthermore, we use this method to prove the existence and estimate the solution of fractional integral equations. The D-plus iterative method shows the good performance in solve fractional integral equations. We also give some example to illustrate main results.
ON EDGE IRREGULAR LABELING WITH MINIMUM DISTINCT INTEGER LABELS FOR SOME STANDARD GRAPHS Husnul Khotimah; Fitriana Hasnani; Meryta Febrilian Fatimah
Jurnal Matematika UNAND Vol. 15 No. 4 (2026)
Publisher : Department of Mathematics and Data Science, Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.4.551-564.2026

Abstract

In this paper, we introduce a new variant of edge irregular labeling on graphs. For a simple graph G, let f be an edge labeling, where S is a finite set of nonnegative integers, and define the weight of each vertex as the sum of the labels of all incident edges. In the case where all vertex weights are pairwise distinct, then the labeling is called edge irregular. We define the minimum distinct edge-label number of G, denoted by md G, as the minimum cardinality of a label set S for which G admits such a labeling. This parameter may be viewed as a distinct irregularity type invariant, since it minimizes the number of distinct labels used rather than the largest label value. We establish exact values of md G for three standard graph families: paths, cycles, and stars. The obtained results demonstrate that this parameter exhibits different behavior across these graph classes and is strongly influenced by local degree structure and edge incidence patterns.