Article Per Year (5 Year)
p-Index From 2020 - 2025
0.659
P-Index
This Author published in this journals
All Journal Jurnal Kajian Matematika dan Aplikasinya
Mohammad Agung
Jurusan Matematika, Universitas Negeri Malang
Mathematics

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

Found 3 Documents
Search

 1 
BEBERAPA KELAS GRAF RAMSEY MINIMAL UNTUK LINTASAN P_3 VERSUS P_5 Desi Rahmadani; Hilda Assiyatun; Mohammad Agung
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 1 (2021): January
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i12021p14-18

Abstract

In 1930, Frank Plumpton Ramsey has introduced Ramsey's theory, in his paper titled On a Problem of Formal Logic. This study became morepopular since Erdős and Szekeres applied Ramsey's theory to graph theory. Suppose given the graph F, G and H. The notation F → (G, H)  states thatfor any red-blue coloring of the edges of F implies F containing a red subgraph of G or a blue subgraph of H. The graph F is said to be the Ramsey graph for graph G versus H (pair G and H) if F → (G, H). Graph F is called Ramsey minimal graph for G versus H if  first, F → (G, H) and second, F satisfies the minimality property i.e. for each e ∈ E (F), then F-e ↛ (G, H). The class of all Ramsey (G, H) minimal graphs is denoted by (G, H). The class (G, H) is called Ramsey infinite or finite if  (G, H) is infinite or finite, respectively. The study about Ramsey minimal graph is still continuously being developed and examined, although in general it is not easy to characterize or determine the graphs included in the (G, H), especially if  (G, H) is an infinite Ramsey class. The characterization of graphs in (, ) has been obtained. However, the characterization of graphs in (, ), for every 3 ≤ m < n is still open. In this article, we will determine some infinite classes of Ramsey minimal graphs  for paths  versus . 
PRESERVING SUBINJECTIVITY DOMAIN OF A MODULE Mohammad Agung; Indah Emilia Wijayanti; Desi Rahmadani
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 1, No 1 (2020): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v1i12020p37-41

Abstract

An ????-module ???? is said to be indigent if its subinjectivity domain consists of only an injective module. In this paper, we study some properties of the indigent module. We give some examples of rings which have an indigent module. We also prove that subinjectivity domain of a module is preserved and reflected under equivalence.
BENTUK CAYLEY COLOR DIGRAPH GRUP SIKLIK G DENGAN ORDER n M. Ariq Zainurrifqi; Mohammad Agung; Indriati Nurul Hidayah
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 3, No 2 (2022): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v3i22022p1-14

Abstract

Let  G be a cyclic group with set of generators . Let G with color  xi is a digraph with vertices elements of  and there is an arrow from  to  if . In this artcle, we find the Cayley color digraph of a cylic group of order . We also proved the existence of Hamiltonian cycle of the graph
Co-Authors Desi Rahmadani Hilda Assiyatun Indah Emilia Wijayanti Indriati Nurul Hidayah M. Ariq Zainurrifqi