Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND
Fitriana Hasnani
Universitas Lampung
Computer Science & IT Mathematics

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

Found 2 Documents
Search

 1 
LEONTIEF MATRIX: BUSINESS MODEL RECOMMENDATION FOR EXPORT COMMODITY OF NORTH SUMATERA Nur Khasanah; Nikken Prima Puspita; Fitriana Hasnani; Meryta Febrilian Fatimah; Zakaria Bani Ikhtiyar
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

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

Abstract

The open model as the one the application of Leontief model using the explanation of the economy with input-output model. The open model shows the number of productions needed to satisfy an increase in internal and external demand. By using the operation linear algebra operation on ring characteristics, then the production numbers are calculated. This method is applied on the ten product-producing commodities of North Sumatera export demand to find the total production number, while the amount of demand is defined. It shows a solution to the minimization linear program is the solution that will satisfy both internal and external demands of the commodity with minimum inventory level.
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.
Co-Authors Husnul Khotimah Meryta Febrilian Fatimah Nikken Prima Puspita Nur Khasanah Zakaria Bani Ikhtiyar