Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : MATEMATIKA

KAITAN ANTARA SUPLEMEN SUATU MODUL DAN EKSISTENSI AMPLOP PROYEKTIF MODUL FAKTORNYA DALAM KATEGORI [M] ., Fitriani
MATEMATIKA Vol 14, No 3 (2011): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

Let M be an R-module and N Î s[M]. A projective module P with a superfluous epimorphism p : P ® N is called projective cover of N in s[M]. Even if there are enough projective module in s[M], a module need not have a projective cover. To get projective cover, we need supplement which do not always exist. In this paper, we will investigate relation between supplement of a module M and existence projective cover of a factor module of M.
MODUL BERSUPLEMEN UTAMA SEBAGAI GENERALISASI DARI MODUL BERSUPLEMEN ., Fitriani
MATEMATIKA Vol 18, No 1 (2015): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

An R-module M is called supplemented if every submodule of M has a supplement in M. Principally supplemented modules are defined as generalizations of lifting, principally lifting and supplemented modules. In this paper, we will characterize principally supplemented modules as a generalization of supplemented module respect to duo module and distributive module.
PERSAMAAN UMUM JUMLAH EDGE DAN TITIK PADA CYCLE EXTENSION CUBIC GRAPH Hambali, Mohamad Ibnu; ., Wamiliana; ., Fitriani
MATEMATIKA Vol 17, No 3 (2014): Jurnal Matematika
Publisher : MATEMATIKA

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

Abstract

In this research we will discuss about cycle extension  of  cubic graph. The cubic graphs used are the cucic graph with n(V(G)) ≤ 8 and k ≥ 3, ;  k is the length of the cycle C and li is the number of vertices or points on  that located between  and  .  The construction process for determining the  use six operations which are M1, M2, M3, M4, M5, dan M6. The result of M1 process on     is a non Hamiltonian cycle while the results of M2, M3, M4, M5, and M6 are Hamiltonian cycles. We also show that the  number of vertives on the   is  n(V()) = n (V(G)) + 2 k  , and  the number of edges on the   is  n(E() = n (E(G)) + 3 k.