cover
Contact Name
Zainur Rasyid Ridlo
Contact Email
cgant.unej@gmail.com
Phone
+6285335111231
Journal Mail Official
cgant.unej@gmail.com
Editorial Address
Jl. Kalimantan Tegalboto No.37, Krajan Timur, Sumbersari, Kec. Sumbersari, Kabupaten Jember, Jawa Timur 68121
Location
Kab. jember,
Jawa timur
INDONESIA
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Published by Universitas Jember
ISSN : -     EISSN : 27227774     DOI : https://doi.org/10.25037/cgantjma
Core Subject : Science, Education,
Subjects suitable for publication include, the following fields of: Degree Diameter Problem in Graph Theory Large Graphs in Computer Science Mathematical Computation of Graph Theory Graph Coloring in Atomic and Molecular Graph Labeling in Coding Theory and Cryptography Dimensions of graphs on Control System Rainbow Connection in Delivery Design System Ramsey Theory and Its Application on Physics Graph Theory in Communication and Electrical Networks Graph Theory in Quantum Mechanics and Thermodynamics Spectral Graph Theory in Vibration and Noise Graph Theory in Statistical Physics and Mechanics Graph theory in Network of Quantum Oscillators Applied Mathematics on Environment, Biophysics and Engineering Machine Learning and Artificial Neural Networks Mathematical and Computational Education
Articles 6 Documents
Search results for , issue "Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS" : 6 Documents clear
Aktivitas Pembelajaran Berbasis Proyek Terintegrasi dalam Pendekatan STEM: Pemanfaatan Cardboard bekas dalam Mendesain VR (Virtual Reality) Berdasarkan Konsep Pembiasan Cahaya pada Lensa Cembung Sebagai Media Proyeksi Video 3D untuk Meningkatkan Metaliterasi Siswa Okti Anis Safiati; Dafik Dafik; Zainur Rasyid Ridlo
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v3i2.80

Abstract

After the Covid-19 pandemic, students are used to online learning, namely learning using gadgets. It is a fact that more students use their gadgets to play online games than educational sites. In playing online games students feel they are in a game that seems real. It's not uncommon for gamers to buy a VR box to play 3D games more realistically. VR or Virtual Reality is a medium of interaction between humans and computers that makes users feel that they are in a computer environment. The aim of this research is to make VR with the right and cheaper materials, namely used cardboard and plastic bottles. The results of this study are Virtual Reality to improve students' metalliteracy abilities. Metalliteration ability is very important in the industrial era 4.0. Metalliteracy is a comprehensive framework of thinking that goes beyond other literacy with the main literacy being technology and information literacy. This metalliteracy ability is still relatively new, therefore, in this study a project-based learning model that is integrated with the STEM (Science, Technology, Engineering, Mathematics) approach is applied to improve students' metalliteracy abilities by presenting STEM problem solving in learning. The STEM problem raised in this study is the use of used cardboard in making VR (virtual reality). Shiva made VR based on the concept of light refraction in convex mirrors, then PjBL and STEM tools were developed in learning to increase student metalliteracy by calculating the surface area of geometric shapes. The results of the research are in the form of learning activities in the form of table descriptions of 1-6 stages of learning activities.
Framework Research Based Learning dengan Pendekatan STEM dalam Penerapan Materi Permutasi Masalah Klasifikasi Ikan Pemangsa dan Mangsa untuk Meningkatkan Mathematical Literacy Anisa Meilinda Wardani; Dafik Dafik; Saddam Hussen
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v3i2.77

Abstract

Mathematical literacy ability is a very important ability in learning mathematics. Through mathematical literacy, students are expected to be able to formulate, define, and interpret mathematics in various problem-solving contexts of everyday life. Mathematical literacy is also related to the international assessment standard, namely PISA, where PISA results in Indonesia are still considered low. One of the causes of low mathematical literacy ability is that the learning model and approach given are still not optimal. Therefore, this study aims to develop a framework for research-based learning activities or research-based learning with the STEM approach in applying permutation material to the problem of classification of predatory and prey fish to improve mathematical literacy. The method used in this study is a qualitative method. The results of this study are in the form of a research based learning framework with a STEM approach. The results of the syntax are then applied to the learning tools used in the learning process. Therefore, this research produces a new syntax for research based learning that is integrated with STEM.
Pewarnaan Sisi Ketakteraturan Lokal Refleksif pada Keluarga Graf Planar Nuwaila Izzatul Muttaqi; Dafik Dafik; Robiatul Adawiyah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v3i2.83

Abstract

All graph in this paper is simple and connected graph where $V(G)$ is vertex set and $E(G)$ is edge set. Let function $f : V(G)\longrightarrow \{0, 2,..., 2k_v\}$ as vertex labeling and a function $f: E(G)\longrightarrow \{1, 2,..., k_e\}$ as edge labeling where $k=max\{2k_v,k_e\}$ for $k_v,k_e$ are natural number. The weight of edge $ u,v\in E(G) $ under $f$ is $w(u)=f(u)+ \Sigma_{uv \in V(G)} f(uv)$. In other words, the function $f$ is called local edge irregular reflexive labeling if every two adjacent edges has distinct weight and weight of a edge is defined as the sum of the labels of edge and the labels of all vertex incident this edge When we assign each edge of $G$ with a color of the edge weight $w(uv)$, thus we say the graph $G$ admits a local edge irregular reflexive coloring. The minimum number of colors produced from local edge irregular reflexive coloring of graph $G$ is reflexive local irregular chromatic number denoted by $\chi_{lrecs}(G).$ Furthermore, the minimum $k$ required such that $\chi_{lrecs}(G)=\chi(G)$ is called a local reflexive edge color strength, denoted by \emph{lrecs}$(G)$. In this paper, we learn about the local edge irregular reflexive coloring and obtain \emph{lrecs}$(G)$ of planar related graphs.
Rainbow Vertex Antimagic Coloring 2-Connection paada Keluarga Graf Tangga Ahmad Musyaffa' Hikamuddin; Dafik Dafik; Rafiantika Megahnia Prihandini
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v3i2.88

Abstract

All graph in this paper are connected graph and simple graph. Let G = (V,E)be a connected graph. Rainbow vertex connection is the assignment of G that has interior vertices with different colors. The minimum number of colors from the rainbow vertex coloring in graph G is called rainbow vertex connection number. If wf(u) ̸= wf(v) for two different vertext u, v ∈ V (G) then f is called antimagic labeling for graph G. Rainbow vertex antimagic coloring is a combination between rainbow coloring and antimagic labeling. Graph G is called rainbow vertex antimagic coloring 2-connection if G has at least 2 rainbow paths from u − v. Rainbow vertex antimagic coloring 2-connection to denoted as rvac2(G). In this paper, we will study rainbow vertex antimagic coloring 2-connection on a family of graphs ladder that includes H-graph Hn for n ≥ 2, slide ladder graph SLn for n ≥ 2, and graph Octa-Chain OCn for n ≥ 2.
Pemodelan Pola Aliran Fluida 2D di Area Panas Bumi Menggunakan Metode Elemen Hingga Pendekatan Galerkin Samsul Bahri; Aditya Ramadhan
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v3i2.81

Abstract

Indonesia is one of the countries with the largest geothermal potential in the world, reaching 40% of the world's potential. In geothermal areas there are several layers such as overburden, reservoirs, fractures and heat sources. Subsurface fluid flow patterns in geothermal areas are a topic that is often discussed, especially for exploration purposes. Fluid flow basically uses the principles of Darcy's law, the principle of continuity and the Navier-Stokes equation. In solving this equation, a numerical approach can be used, where the results are close to the actual value. The numerical method used in this study is the finite element method, where the geometric domain is divided into smaller domains. The shape of the two-dimensional elements used is a non-linear triangle. The purpose of this study is to describe the pattern of fluid flow in porous media, especially in the case of geothermal areas and to determine the effect of rock permeability anomalies on fluid flow patterns. The results of modeling with the finite element method show that rock permeability affects the pattern of fluid flow. Liquid will flow at a higher velocity to an area of higher permeability.
On Inclusive Local Irregular Vertex Coloring of Shackle Operation Graph Madila Khomsiyanti; Arika I Indah Kristiana; E R Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25037/cgantjma.v3i2.74

Abstract

A graph  is an ordered pair of two sets V and E, written .  is the set of vertices and  is the set of edges of the graph . The labeling of the graph is defined by  where  is the labeling of the vertices. The function  is the vertex coloring of the inclusive local irregularity if . The minimum color of the inclusive local irregularity vertex coloring is called the inclusive local irregularity chromatic number. This article will discuss the coloring of inclusive local irregularities on the graph resulting from the vertex shackle operation.

Page 1 of 1 | Total Record : 6