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 
NILAI EKSAK BILANGAN DOMINASI COMPLEMENTARY TREE TERHUBUNG-3 PADA GRAF CYCLE, GRAF LENGKAP DAN GRAF WHEEL Agustiarini, Efni; Ratnasari, Lucia; ., Widowati
MATEMATIKA Vol 18, No 1 (2015): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Given a graph G with a set of vertices V and the set of edges E. Let  be a subset of , if each vertex of  is adjacent to at least one vertex of , then  is called a dominating set in . The domination number of a graph  denoted as  is the minimum cardinality taken from all dominating sets of . Sometypes of dominating set has been developed based on domination perameter, such as connected dominating set, triple connected dominating set, complementary tree dominating set and triple connected complementary tree dominating set. A subset  with , a nontrivial connected graph is said to be triple connected complementary tree dominating set, if  dominating set,  is a triple connected graph and  is a tree. The triple connected complementary tree domination number of G is denoted as  In this paper we study about triple connected complementary tree domination number, especially on the cycle graph, complete graph and wheel graph. For any cycle graph and complete graph of order  have . For any wheel graph of order  have
MODEL OPTIMASI ECONOMIC PRODUCTION QUANTITY DENGAN SISTEM DELIVERY ORDER Puspita, Nikken Prima; Khabibah, Siti; Ratnasari, Lucia
MATEMATIKA Vol 17, No 2 (2014): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

The aims of Economic Production Quantity models are for manage the production schedule and product inventory. The first Economic Production Quantity model developed by E.W Taft on 1918. Taft make some asumption such as daily demand rate constant, daily production rate constant, not stockout allowed, single item product and daily production rate are more than daily demand rate. On the process of delivery product,  there is not transportation cost. Pasandideh dan Niaki on 2010 was constructed an Economic Production Quantity models with discrete delivery order. In this research we discussed the Economic Production Quantity model which products delivered by multiple palet system and with transportation cost.
OPERASI GABUNGAN, JOIN, KOMPOSISI DAN HASIL KALI KARTESIAN PADA GRAF FUZZY SERTA KOMPLEMENNYA Novia, Tina Anggitta; Ratnasari, Lucia
MATEMATIKA Vol 13, No 3 (2010): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

A fuzzy graphs  is a nonempty set together with a pair function  and satisfied  This paper described about some operations on fuzzy graphs such as union, join, compositions and cartesian product. Complement of union two fuzzy graphs is join of their complement, join complement of two fuzzy graphs is union their complement. Complement of composition two strong fuzzy graphs is composition of their complement, but complement of cartesian product two stong fuzzy graphs is need not cartesian product of their complement.
PELABELAN PRIME CORDIAL PADA BEBERAPA GRAF YANG TERKAIT DENGAN GRAF SIKEL Hapsari, Nindita Yuda; Utomo, Robertus Heri Soelistyo; Ratnasari, Lucia
MATEMATIKA Vol 18, No 1 (2015): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Prime cordial labeling of a graph  is a bijective mapping of the set vertex  to the set  where  is the number of vertex . The edge labeling induced the vertex labeling, which is obtained by finding the great common divisor (gcd) of the label of vertex which it’s adjacent. If gcd of the adjacent vertex label is 1 then the label of edge is 1, but if gcd of the adjacent vertex label value other than 1 then the label of edge is 0, and the absolute value of the difference between the number of edges labeled 0 and the number of edges labeled 1 is less than equal with 1. A graph admits prime cordial labeling is called prime cordial graph. In this paper, we study about edge duplication cycle graph  (except for ), vertex duplication cycle graph , path union union of cycle the graph  and friendship graph one point union of    copies of cycle .
PELABELAN GRACEFUL GENAP BARU PADA GRAF CmPn Ratnasari, Lucia; Surarso, Bayu; Utomo, Robertus Heri Soelistyo
MATEMATIKA Vol 17, No 2 (2014): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Pelabelan Graceful pada graf dengan q sisi merupakan pemetaan injektif   , yang mengakibatkan pemetaan , yang didefinisikan dengan  bersifat bijektif. Graf yang memenuhi pelabelan graceful disebut graf graceful. T. Mahalaksmi Senthil Kumar, T. Abarna Parthiban dan T. Vanadhi [4], membuktikan graf CmÈPn merupakan graf graceful genap untuk m ganjil yang memenuhi kondisi tertentu. Marry U dan Saranya D [2], membuktikan bahwa graf CmÈPn merupakan graf graceful genap untuk m genap yang memenuhi kondisi tertentu. Pelabelan graceful genap didefinisikan sebagai pemetaan injektif  yang mengakibatkan pemetaan , yang didefinisikan  bersifat bijektif.  Tetapi pada pembuktian [4] dan [2], syarat injektif dan bijektif fungsinya tidak terpenuhi. Artikel ini mendefinisikan kembali pelabelan graceful genap pada graf CmÈPn sehingga syarat injektif dan bijektif fungsinya terpenuhi.  
SIFAT-SIFAT ISOMORFISMA GRAF FUZZY PADA GRAF FUZZY KUAT Handayani, Anik; Ratnasari, Lucia
MATEMATIKA Vol 15, No 1 (2012): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Fuzzy graph is a graph consists pairs of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. A fuzzy graph  is said to be a strong fuzzy graph if degree of membership edge with the same minimum degree of membership vertex and degree of membership vertex for each edge   with . In this paper describes the properties of fuzzy graphs isomorphism include weak isomorphism, co-weak isomorphism, and isomorphism on strong fuzzy graph.  
PATH KUAT TERKUAT DAN JARAK KUAT TERKUAT DALAM GRAF FUZZY Ekawati, Lusia Dini; Ratnasari, Lucia
MATEMATIKA Vol 16, No 1 (2013): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Fuzzy graph is a graph consists pair of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each node and edge. A graph fuzzy  is connected if the strength of connectedness between nodes u and v larger than zero for each . This paper will be explained about ss-path and ss-distance. Strongest stong path (ss-path) between two nodes in connected fuzzy graph if path is a strongest path as well as strong path. If G is a connected fuzzy graph then for each  there exists a strongest strong path for u to v . While ss-distane between two nodes u and v in connected fuzzy graph as the reciprocal of  the strength of connectedness between nodes u and v. Using metric can be known that every connected fuzzy graph is ss-selfcentered
MENYELESAIKAN SISTEM PERSAMAAN LINIER MENGGUNAKAN ANALISIS SVD ahmad, irdam haidir; ratnasari, lucia
MATEMATIKA Vol 13, No 1 (2010): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Linear equation system, Ax = b, may be consistent or inconsistent. The approximate solution of  inconsistent of linear equation system can be determined. Gauss elimination or Gauss-Jordan elimination can be used to determine the solution of the consistent of linear equation system, but can’t for the inconsistent of linear equation system. Singular Value Decomposition (SVD) is matrix factorization method that closely associated with the singular value of the matrix. SVD analysis can be used to determined the orthonormal bases for the four fundamental subspaces associated with matrix A. That bases can be used to compute thesolution of the consistent and inconsistent of  linear equation system.  
PELABELAN GRACEFUL SISI-GANJIL PADA GRAF WEB W(2,n) Rizky, Putri Dentya; Ratnasari, Lucia; ., Djuwandi
MATEMATIKA Vol 17, No 1 (2014): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Let G = (V(G),E(𝐺)) be a graph with vertex set 𝑉(𝐺) and edge set 𝐸(𝐺). Assume that graph G have 𝑞 edge. Graceful edge-odd labeling is a bijective map  𝑓 ∶ 𝐸(𝐺) →  {1, 3, 5,…,2𝑞 – 1} that resulting map 𝑓+ : 𝑉(𝐺) → {0,1,2,…,2𝑞 −1} with  such as obtained different edge label. Graph G ia called Graceful edge-odd labeling if there is graceful edge-odd labeling on G. Let  and  are two cycle graph with vertex set  and . Graph  is obtained by conected every vertex from  to   such as we have edge  Graph Web W(2,n) is a graph obtained by adding a pendant edge on each outer cycle vertex from graph . In this paper we will discussed about Graceful edge-odd labeling on Web (2,𝑛) graph and we have that Web W(2,𝑛) graph is graceful edge odd graph for n odd.
LOKALISASI ORE Ratnasari, Lucia
MATEMATIKA Vol 9, No 3 (2006): JURNAL MATEMATIKA
Publisher : MATEMATIKA

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

Abstract

Let  be a noncommutative ring and  be a multiplicative subset of . The right (left) ring of quotients does not exist for every. A necessary condition of existence right (left) ring of quotients is  right (left) permutable and right (left) reversible. A multiplication subset  is called a right (left) denominator if it is right (left) permutable and right (left) reversible. The ring  has a right (left) ring of quotients with respect to  if and only if  is a right (left) denominator set. We can construct right (left) ring of quotients by using Ore localizations.
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