Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal MATEMATIKA Jurnal Matematika Jurnal Pengabdian Kepada Masyarakat (JPKM) Tabikpun
Lucia Ratnasari
Unknown Affiliation
Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Education Health Professions Mathematics

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

Found 26 Documents
Search

 1   2   3 
GRAF FUZZY REGULER DAN HUBUNGANNYA DENGAN GRAF FUZZY REGULER TOTAL Natalia, Priskila Denny; Ratnasari, Lucia
MATEMATIKA Vol 14, No 2 (2011): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (15.988 KB)

Abstract

Fuzzy graph is a graph consists pairs of vertex set and edge set that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. Regular fuzzy graph and totally regular fuzzy graph were defined by A.Nagoor Ghani and K.Radha. This paper studied the definitions of regular fuzzy graph and totally regular fuzzy graph. Next, showed that a necessary and sufficient condition under which regular fuzzy graph and totally regular fuzzy graph were equivalent
BILANGAN DOMINASI PERSEKITARAN PADA GRAF LENGKAP DAN GRAF BIPARTIT LENGKAP Ratnasari, Lucia; Surarso, Bayu; Harjito, Harjito; Maunah, Uun
MATEMATIKA Vol 20, No 1 (2017): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1321.963 KB)

Abstract

Given graph  with set of vertex  and set of edge E. Set  subset of  is called domination set if every point in  is adjacent with at least one point in  in graph . The minimum cardinality of all set of domination graph  is called domination number. Let  be a subset of , set  is called a neighborhood set if  with   induced subgraph  of . The minimum cardinality of all the neighborhood set of graph  is called the neighborhood number. There are several types of neighborhood domination number depending on the parameters. In this paper we examine the transversal neighborhood domination number and global neighborhood domination number in complete graph and complete bipartite graph.
DIGRAF EKSENTRIS PADA DIGRAF SIKEL, DIGRAF KOMPLIT DAN DIGRAF KOMPLIT MULTIPARTIT K, Retno Catur; Ratnasari, Lucia
MATEMATIKA Vol 11, No 1 (2008): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (101.717 KB)

Abstract

The eccentric digraph of a digraph, , is the digraph that has the same vertex set as  and the arc set defined by: there is an arc from  to  if and only if  is an eccentric vertex of . In this paper, we examine eccentric digraphs of  digraphs of varoius families of digraphs and we consider the behaviour of an iterated sequence of eccentric digraphs of a digraph.  
PELABELAN AKAR RATA-RATA KUADRAT PADA GRAF LADDER〖 L〗_n DAN GRAF CORONA〖 P〗_n⨀K_2 Mubarok, Azhar; Ratnasari, Lucia; Djuwandi, Djuwandi
MATEMATIKA Vol 19, No 2 (2016): Jurnal Matematika
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (163.028 KB)

Abstract

A graph G with p vertices and q edges. A Root Square Mean Labeling of graph  is an injective function from the set of vertices  to the set  with  edge is the number of side on the graph such that when each edges  is labeled by a function that defines as  ceilling function or floor function from root square mean  and , then the edge labels are distinct. For each of graphs that uses root square mean labeling is called as Root Square Mean graph. In this paper, the study is about root square mean labeling on Ladder graph, Corona graph . Then, we prove that  and  graph  are included as the root square mean graph. 
INTEGER QUADRATIC OPTIMIZATION MODEL TO SOLVE SUPPLIER SELECTION PROBLEM WITH BUDGETARY CONSTRAINT Sagita, Hendry; Sutrisno, Sutrisno; Ratnasari, Lucia
MATEMATIKA Vol 20, No 2 (2017): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (740.567 KB)

Abstract

In this paper, we propose an integer quadratic optimization model to determine the optimal decision for a supplier selection problem. The decision is the optimal product volume that has to be purchased from each supplier so that the total cost is minimum and the constraints are satisfied. The cost function that we used is containing the purchasing cost, transportation cost, penalty cost for product that not satisfy the quality level, penalty cost for product that is late and the holding cost whereas the constraints are consisting of supplier capacity constraint, demand satisfying, supplier assignment, inventory management, and budget constraint. A numerical experiment with generated random data is given to illustrate how the supplier selection problem can be solved by using the proposed mathematical model. From the results, the optimum product volume from each suppliers was determined so that the total cost is minimum.
METODE ASM PADA MASALAH TRANSPORTASI SEIMBANG Septiana, Arum Ryani; Solikhin, Solikhin; Ratnasari, Lucia
MATEMATIKA Vol 20, No 2 (2017): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (658.223 KB)

Abstract

The transportation problem is special case on the linear programming which examines the goods’ distribution for minimize shipping cost or maximize profits. In general, transportation problem requires two stages of completion, which is looking for feasible solution first and the look for the optimal solution. Abdul Quddoos, Dr. Shakeel Javaid, and Prof. Mohd Masood Khalid did some research for a new method, ASM method which is direct method with simple and fast way. This method relies on the cell that has the number 0 with the smallest index, and used to minimize transport costs. This final project determines the optimal solution using ASM method, both to mimize costs and maximize profits, and investigate the optimal method of ASM. The solution that obtained by ASM method on balanced transportation problem is always optimal, while for unbalanced transportation problem is not always optimal. The difference between algorithm for minimizing cases and maximize cases lies only in the first step, which is if the maximization case, then change c_ij into(-c_ij ).
PENYELESAIAN MASALAH LINTASAN TERPENDEK FUZZY DENGAN MENGGUNAKAN ALGORITMA CHUANG – KUNG DAN ALGORITMA FLOYD Anik Musfiroh; Lucia Ratnasari
Jurnal Matematika Vol 1, No 1 (2012): jurnal matematika
Publisher : MATEMATIKA FSM, UNDIP

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (669.611 KB)

Abstract

Abstract : In the classic graph, shortest path problem is related problem with determination of the which are connected in a graph that form the shortest distance between source node and the destination node. This idea is extended to solve the fuzzy shortest path problem. In this paper, will be discussed about Chuang - Kung algorithm and Floyd algorithm to solve shortest path problem. Chuang - Kung algorithm’s steps is to determine all pass possible path from source node to destination node, then compute value of similarity degree SLmin, Li with Lmin is the fuzzy shortest length and Li is length of possible path. While for Floyd algorithm, the first step is to determine the initial distance matrix D0 and the  matrix of the initial order S0 , then check this elements. If in matrix Dk element is dik+dkj<dij so dij replaced with Lmin dij, dik+dkj . Then replace elements matrix Sk with k . Changes sij in matrix Sk following to changes dij on matrix Dk .
Energi Derajat Maksimal pada Graf Terhubung Destika Dwi Setyowidi; Lucia Ratnasari
Jurnal Matematika Vol 1, No 1 (2012): jurnal matematika
Publisher : MATEMATIKA FSM, UNDIP

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (433.737 KB)

Abstract

Graf G adalah pasangan himpunan (V,E) , dengan V(G) adalah himpunan titik G dan E(G) adalah himpunan sisi G . Graf G dapat direpresentasikan ke dalam matriks derajat maksimal. Dari matriks derajat maksimal diperoleh polinomial karakteristik μn+c1μn-1+c2μn-2+…+cn dengan koefisien c1 merupakan traceM(G) , c2 merupakan penjumlahan dari determinan submatriks order 2, c3 merupakan penjumlahan dari determinan submatriks order 3. Energi derajat maksimal graf G adalah penjumlahan dari harga mutlak nilai eigen derajat maksimal. Energi derajat maksimal graf star (Sn+1) , graf sikel (Cn) , graf path Pn , dan graf regular r bernilai kurang dari energi derajat maksimal graf komplit (Kn) . Energi derajat maksimal EMG berupa bilangan rasional dengan bilangan rasional tersebut adalah bilangan bulat genap
PELABELAN CORDIAL UNTUK GRAF SPLIT DARI BEBERAPA GRAF Nisa Erma Fitriana; Lucia Ratnasari
Jurnal Matematika Vol 1, No 1 (2012): jurnal matematika
Publisher : MATEMATIKA FSM, UNDIP

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Cordial labeling is a binary point labeling that have absolute value condition of the difference in the number of vertices having label 0 and the number of vertices having label 1 is less than or equal to 1 dan absolute value of the difference in  the number of edges having label 0 and the number of edges having label 1 is less than or equal to 1. Graph which qualified of cordial labeling is called cordial graph. Split graph S(G) is the graph obtained by taking a new vertex v’ for each vertex v of a graph G , a new vertex v’ is connected to all vertices of G which adjacent to v . In this final paper explored about cordial labeling for split graph of path graph, cycle graph, wheel graph, matching graph, fan graph, bipartite complete graph, and k copies star graph
PELABELAN DIVISOR CORDIAL PADA BEBERAPA GRAF Aptri Wijayanti; Lucia Ratnasari
Jurnal Matematika Vol 2, No 3 (2013): JURNAL MATEMATIKA
Publisher : MATEMATIKA FSM, UNDIP

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

ABSTRAK. Diberikan pemetaan bijektif f dari himpunan titik V(G) ke {1,2,…,|V|}. Pelabelan sisi induced berlabel 1 apabila f(u) dapat membagi f(v) atau f(v) dapat membagi f(u) dan berlabel 0 untuk yang lainnya, dimana u dan v adalah titik yang incident dengan sisi uv. Pemetaan f disebut pelabelan divisor cordial bila harga mutlak dari selisih banyaknya sisi yang mempunyai label 0 dan banyaknya sisi yang mempunyai label 1 kurang dari atau sama dengan 1. Graf yang memenuhi syarat pelabelan divisor cordial disebut graf divisor cordial. Pada jurnal ini dikaji bahwa graf path, graf cycle, graf wheel, graf star, graf bipartit lengkap K_(2,n), graf bistar dan graf subdivisi dari graf star (S(K_(1,n) )) merupakan graf divisor cordial.
Co-Authors 'Aliyah, Dheva Ufiz Alfiana, Shinta Nur Alhusna, Lathifatul Inayah Anik Handayani Anik Musfiroh Aptri Wijayanti Azhar Mubarok, Azhar Bambang Irawanto Bayu Surarso Destika Dwi Setyowidi Djuwandi ., Djuwandi Djuwandi Djuwandi Efni Agustiarini, Efni Ermi Suwarni Harjito - Irdam Ahmad Isa Isa K, Retno Catur Lusia Dini Ekawati, Lusia Dini Maunah, Uun Nikken Prima Puspita Nindita Yuda Hapsari, Nindita Yuda Nisa Erma Fitriana Paramita, Arum Qurrotulaini Pradjna Priskila Denny Natalia Putri Dentya Rizky Putri Dentya Rizky, Putri Dentya Redemtus Heru Tjahjana Robertus Heri Sulistyo Utomo Sagita, Hendry Septiana, Arum Ryani Siti Khabibah Solikhin Solikhin Sutrisno, Sutrisno Tina Anggitta Novia Utami, Ratna Zakiyya Meilia Utomo, R. Heri Soelistyo Utomo, R. Heri Soelistyo Widowati ., Widowati Zumiafia Ross Yana Ningrum