Garuda - Garba Rujukan Digital

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

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

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.

STUDI ALGORITMA IGVNS, ALGORITMA GVNS, DAN ALGORITMA ABC PADA MULTIPLE TRIP VEHICLE ROUTING PROBLEM (MTVRP) Nurul Faridhatul Aini; Vita Kusumasari; Desi Rahmadani
Jurnal Kajian Matematika dan Aplikasinya (JKMA) Vol 2, No 2 (2021): July
Publisher : UNIVERSITAS NEGERI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um055v2i22021p26-31

The Multiple Trip Vehicle Routing Problem (MTVRP) is one of the VRP variants with vehicle capacity constraints, and the limited number of vehicles allows each vehicle to distribute more than one route so as to minimize the number of vehicles used. The algorithm used in this study is the Improved General Variable Neighborhood Search (IGVNS) algorithm. The IGVNS algorithm is a hybrid between the GVNS algorithm and the VNS algorithm. The calculation results of the IGVNS algorithm will be compared with the GVNS algorithm and the ABC algorithm. The main stages of the IGVNS and GVNS algorithms are initial solution formation, perturbation, and solution improvement. The main stages of the ABC algorithm are initialization, solution improvement and optimization. Based on manual calculations using 8 points, the ABC algorithm produces a distance of 86 km and a service time of 1.47 hours, the GVNS algorithm produces a distance of 80 km and a service time of 1.37 hours, the IGVNS algorithm produces a distance of 79 km and service time is 1.35 hours. Based on one example of the ABC algorithm, the calculation solution using the IGVNS algorithm shows more optimal results. Based on the results of parameter testing, the parameter affects the calculation results, that is the greater the value, the more optimal the resulting solution. While the parameter does not affect the calculation results because it shows constant results in two successive iterations carried out.

Pengembangan Sistem Informasi Manajemen Pertanian Menggunakan Framework Codeigniter Untuk Kelompok Tani Desa Bendosewu Blitar Denis Eka Cahyani; Desi Rahmadani; Lucky Tri O; Mahmuddin Yunus
Jurnal KARINOV Vol 4, No 3 (2021): September
Publisher : Institute for Research and Community Service (LP2M), Universitas Negeri Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.17977/um045v4i3p195-200

Kelompok tani Tawang Makmur merupakan kelompok tani di Dusun Tawang, Desa Bendosewu yang merupakan penyedia kebutuhan pangan untuk masyarakat khusunya warga Blitar. Tujuan kegiatan pengabdian ini adalah mengembangkan sistem informasi manajemen pertanian untuk kelompok tani desa Bendosewu, Blitar. Sistem informasi manajemen pertanian dibangun menggunakan framework CodeIgniter (CI). Metode yang digunakan adalah tahapan persiapan, pengembangan sistem, sosialisasi, dan evaluasi. Hasil dari pengabdian ini adalah terbangunnya sistem informasi manajemen pertanian untuk kelompok tani. Sistem informasi yang dibangun menyediakan fitur manajemen pertanian seperti pendataan anggota petani, pencatatan pengadaan bahan baku, pendataan penanaman dan hasil panen serta rekapitulasi laporan penanaman dan hasil panen per tahunnya. Selain itu, hasil dari pengabdian ini adalah terbentuknya pemahaman dan keterampilan dari pengelola kelompok tani untuk mengelola sistem informasi guna mendukung peningkatan produktivitas pertanian kelompok tani tersebut. Kata kunci— Sistem informasi manajemen, Pertanian, Kelompok Tani, CodeIgniter Abstract The Tawang Makmur is a farmer group in Tawang Hamlet, Bendosewu Village which is a provider of food needs for the community, especially Blitar residents. The purpose of this service activity is to develop an agricultural management information system for farmer groups in Bendosewu village, Blitar. The agricultural management information system is built using the CodeIgniter (CI) framework. The method used is the stages of preparation, system development, socialization, and evaluation. The result of this service is the establishment of an agricultural management information system for farmer groups. The information system that was built provides agricultural management features such as data collection on farmer members, recording of raw material procurement, data on planting and harvesting, and recapitulation of annual reports on planting and yields. In addition, the result of this service is the formation of understanding and skills of farmer group managers to manage information systems to support increased agricultural productivity of these farmer groups. Keywords— Management information system, Agriculture, Farmer’s Group, CodeIgniter

SUATU KAJIAN TITIK TETAP PEMETAAN k-PSEUDONONSPREADING SEJATI DI RUANG HILBERT Desi Rahmadani
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.52-60.2013

Let C be a subset of a real Hilbert space H. Let T : H ! H be a strictlyk-pseudononspreading mapping with a nonempty xed point set. Let ! 2 [k; 1) be xed.Let fTigNi=1be N k-strictly pseudononspreading mappings. In this paper, we study therelationship between of a xed point set of a k-strictly pseudononspreading mapping andother forms of certain combinations of some k-strictly pseudononspreading mappings inHilbert space.

Pelatihan Olimpiade Matematika Kepada Perwakilan Peserta Kegiatan Olimpiade Sains Nasional (OSN) Iltavia, Iltavia; Fitri, Haida; Rahmi Safitri, Yolanda; Muhammad Yusuf; Desi Rahmadani
Jurnal Dedikasia : Jurnal Pengabdian Masyarakat Vol. 4 No. 1 (2024): Juni 2024
Publisher : Universitas Islam Negeri Sjech M. Djamil Djambek Bukittinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30983/dedikasia.v4i1.8384

This training activity aims to provide enthusiasm and motivation to pupils, students, teachers and other school environments to face the National Science Olympiad, especially mathematics subjects at SMP Negeri 3 Bukittinggi. This training activity was carried out continuously over 3 meetings on 03 June 2023, 05 June 2023 and 09 June 2023. This training activity was carried out using lecture methods, group discussions, games involving 5 mathematics education students. The material presented includes algebra, number theory, geometry and combinatorics. The conclusion is that this activity is able to develop students' learning abilities in solving National Science Olympiad (OSN) questions. This can be seen from the average pretest score which increased from 35.5 to 76.5 when the posttest was held. Kegiatan pelatihan ini bertujuan untuk memberikan semangat dan motivasi kepada mahasiswa, siswa, guru dan lingkungan sekolah lainnya guna menghadapi Olimpiade Sains Nasional khususnya mata pelajaran matematika di SMP Negeri 3 Bukittinggi. Kegiatan pelatihan ini dilakukan secara kontinyu selama 3 kali pertemuan pada tanggal 03 Juni 2023, 05 Juni 2023 dan 09 Juni 2023. Kegiatan pelatihan ini dilaksanakan dengan metode ceramah, diskusi kelompok, permainan yang melibatkan 5 orang mahasiswa pendidikan matematika. Materi yang disampaikan meliputi materi aljabar, teori bilangan, geometri dan kombinatorika

Pelatihan Olimpiade Matematika Kepada Perwakilan Peserta Kegiatan Olimpiade Sains Nasional (OSN) Iltavia, Iltavia; Fitri, Haida; Rahmi Safitri, Yolanda; Muhammad Yusuf; Desi Rahmadani
Jurnal Dedikasia : Jurnal Pengabdian Masyarakat Vol. 4 No. 1 (2024): Juni 2024
Publisher : Universitas Islam Negeri Sjech M. Djamil Djambek Bukittinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30983/dedikasia.v4i1.8384

This training activity aims to provide enthusiasm and motivation to pupils, students, teachers and other school environments to face the National Science Olympiad, especially mathematics subjects at SMP Negeri 3 Bukittinggi. This training activity was carried out continuously over 3 meetings on 03 June 2023, 05 June 2023 and 09 June 2023. This training activity was carried out using lecture methods, group discussions, games involving 5 mathematics education students. The material presented includes algebra, number theory, geometry and combinatorics. The conclusion is that this activity is able to develop students' learning abilities in solving National Science Olympiad (OSN) questions. This can be seen from the average pretest score which increased from 35.5 to 76.5 when the posttest was held. Kegiatan pelatihan ini bertujuan untuk memberikan semangat dan motivasi kepada mahasiswa, siswa, guru dan lingkungan sekolah lainnya guna menghadapi Olimpiade Sains Nasional khususnya mata pelajaran matematika di SMP Negeri 3 Bukittinggi. Kegiatan pelatihan ini dilakukan secara kontinyu selama 3 kali pertemuan pada tanggal 03 Juni 2023, 05 Juni 2023 dan 09 Juni 2023. Kegiatan pelatihan ini dilaksanakan dengan metode ceramah, diskusi kelompok, permainan yang melibatkan 5 orang mahasiswa pendidikan matematika. Materi yang disampaikan meliputi materi aljabar, teori bilangan, geometri dan kombinatorika

Students’ Creative Thinking in Solving Open-Ended Problems in Geometry Transformation Material Stefani Putri Andrianti; Subanji Subanji; Desi Rahmadani
PRISMA Vol. 15 No. 1 (2026): PRISMA
Publisher : Universitas Suryakancana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35194/jp.v15i1.6284

This study aims to describe students’ creative thinking abilities in solving open-ended problems in geometry transformation material. The problem used in this study was designed as a multiple solution task (MST) because it provides students with opportunities to generate more than one strategy or solution. This study employed a descriptive qualitative approach involving 27 students of Class XII-B at a Catholic senior high school in Surabaya. Data were collected through a written test and interviews and were then analyzed based on the indicators of fluency, flexibility, and novelty. The findings show that students were classified into three creativity groups. S1 represented the high-creativity group and demonstrated novelty through a non-routine strategy and by rechecking the solution. S2 represented the moderate-creativity group and demonstrated fluency and flexibility by producing more than one form of solution and using several methods, although the variation remained limited. S3 represented the low-creativity group and did not yet demonstrate fluency or flexibility because the student used only one method and produced a single answer. These findings indicate that open-ended problems in the form of MST can reveal differences in students’ creative thinking abilities in geometry transformation material. Keywords: creative thinking; open-ended; transformation geometry

Elegant Labeling of the Lotus Graph and Its Variations Faliza Hanifatul Husna; Desi Rahmadani
Jambura Journal of Mathematics Vol 8, No 2: August 2026
Publisher : Department of Mathematics, Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/jjom.v8i2.39844

An elegant labeling f of a graph G(V,E) with ∣E(G)∣=q is an injective function f:V(G)→{0,1,2,…,q} such that each edge xy in E(G) is assigned the induced label f∗(xy)=(f(x)+f(y))mod(q+1), where all resulting edge labels are distinct and non-zero. A graph that admits an elegant labeling is called an elegant graph. Research on elegant labelings has been extensively conducted on simple graph classes such as cycle graphs and star graphs. However, for more complex graph structures like the lotus graph, studies on elegant labelings remain unavailable. The lotus graph possesses a unique symmetrical characteristic, systematically constructed from a combination of cycles and a high-degree central vertex. This symmetrical structure presents a distinct mathematical challenge to ensure that the labeling criteria are satisfied. A lotus graph visually resembles a blooming lotus petal, a distinctive structure that mathematically can only be fully realized if it meets the lower bound of p≥3. This study aims to demonstrate that the lotus graph L(p) and its two variations, namely the graph L∗(p) and the graph L(p,p), are elegant graphs for any p≥3. These two variations of the lotus graph are obtained through the deletion of pendant vertices for L∗(p) and the addition of pendant vertices for L(p,p). An exploration patterns is conducted on several simpler lotus graphs, which are subsequently generalized for p≥3, while the analytical method is utilized for formal mathematical verification. The results show that the lotus graph L(p) and its two structural variations, L∗(p) and L(p,p), are elegant graphs for any p≥3. The findings of this research are expected to expand the scope of study on graph classes that admit elegant labelings and serve as a foundation for future advanced studies regarding other structural graph variations.

Growcycle: Pemanfaatan Sampah sebagai Media Tanam di MA Al-Khoirot Malang untuk Mendukung Tujuan Pembangunan Berkelanjutan Rachel Aura Azzahra; Desi Rahmadani; Tjang Daniel Chandra; Denis Eka Cahyani; Ramdhan Fazrianto Suwarman; Ana Apsari Cesaria; Achmad Safikurrohman; Muhammad Al Farabi
Jurnal Pengabdian kepada Masyarakat Nusantara Vol. 7 No. 2 (2026): Edisi Mei - Agustus
Publisher : Lembaga Dongan Dosen

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55338/jpkmn.v7i2.8317

Permasalahan pengelolaan sampah di MA Al-Khoirot Malang ditandai oleh belum optimalnya pemilahan dan pengolahan sampah organik, anorganik, serta residu pembalut sekali pakai, sehingga berpotensi menimbulkan permasalahan lingkungan dan kesehatan. Untuk mengatasi permasalahan tersebut, dilaksanakan program pengabdian masyarakat Growcycle (Grow from Recycle) yang bertujuan meningkatkan pengetahuan dan keterampilan warga sekolah dalam pengelolaan sampah melalui pemanfaatannya sebagai media tanam. Program ini menggunakan pendekatan partisipatif yang dilaksanakan melalui tahapan observasi awal, perencanaan, pelaksanaan, dan evaluasi. Kegiatan utama meliputi pembuatan pot tanam dari sampah anorganik, pengolahan sampah organik menjadi kompos, serta pemanfaatan hydrogel dari limbah pembalut sekali pakai sebagai media tanam alternatif. Peserta kegiatan adalah santriwati MA Al-Khoirot Malang yang terlibat secara aktif dalam seluruh rangkaian praktik. Evaluasi dampak program dilakukan menggunakan instrumen pre-test dan post-test, yang dianalisis secara deskriptif dan dengan uji Wilcoxon Signed Rank Test. Hasil evaluasi menunjukkan adanya peningkatan pengetahuan peserta pada seluruh indikator pengelolaan sampah. Rerata skor pengetahuan meningkat dari 12,00 pada pre-test menjadi 16,40 pada post-test, dengan nilai P = 0,000, yang menunjukkan peningkatan signifikan secara statistik. Selain itu, peserta menunjukkan kemampuan praktik dalam pengelolaan sampah dan pemanfaatannya sebagai media tanam. Temuan ini menunjukkan bahwa program Growcycle efektif dalam meningkatkan kapasitas warga sekolah serta berpotensi mendukung keberlanjutan pengelolaan sampah berbasis sekolah.

Title

Found 10 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 10 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 10 Documents
Search