{"title":"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","authors":"Okti Anis Safiati, D. Dafik, Z. Ridlo","doi":"10.25037/cgantjma.v3i2.80","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i2.80","url":null,"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.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115740722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Framework Research Based Learning dengan Pendekatan STEM dalam Penerapan Materi Permutasi Masalah Klasifikasi Ikan Pemangsa dan Mangsa untuk Meningkatkan Mathematical Literacy","authors":"Anisa Meilinda Wardani, D. Dafik, Saddam Hussen","doi":"10.25037/cgantjma.v3i2.77","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i2.77","url":null,"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.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127354441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pemodelan Pola Aliran Fluida 2D di Area Panas Bumi Menggunakan Metode Elemen Hingga Pendekatan Galerkin","authors":"Samsul Bahri, Aditya Ramadhan","doi":"10.25037/cgantjma.v3i2.81","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i2.81","url":null,"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.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114300413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ahmad Musyaffa' Hikamuddin, D. Dafik, R. M. Prihandini
{"title":"Rainbow Vertex Antimagic Coloring 2-Connection paada Keluarga Graf Tangga","authors":"Ahmad Musyaffa' Hikamuddin, D. Dafik, R. M. Prihandini","doi":"10.25037/cgantjma.v3i2.88","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i2.88","url":null,"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.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pewarnaan Sisi Ketakteraturan Lokal Refleksif pada Keluarga Graf Planar","authors":"Nuwaila Izzatul Muttaqi, Dafik Dafik, R. adawiyah","doi":"10.25037/cgantjma.v3i2.83","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i2.83","url":null,"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,vin 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.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121715945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Madila Khomsiyanti, A. I. Kristiana, E. R. Albirri
{"title":"On Inclusive Local Irregular Vertex Coloring of Shackle Operation Graph","authors":"Madila Khomsiyanti, A. I. Kristiana, E. R. Albirri","doi":"10.25037/cgantjma.v3i2.74","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i2.74","url":null,"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.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Istamala Idha Retnoningsih, D. Dafik, Saddam Hussen
{"title":"Pewarnaan Titik pada Keluarga Graf Sentripetal","authors":"Istamala Idha Retnoningsih, D. Dafik, Saddam Hussen","doi":"10.25037/cgantjma.v3i1.75","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.75","url":null,"abstract":"The graph $G$ is defined as a pair of sets $(V,E)$ denoted by $G=(V,E)$, where $V$ is a non-empty vertex set and $E$ is an edge set may be empty connecting a pair of vertex. Two vertices $u$ and $v$ in the graph $G$ are said to be adjacent if $u$ and $v$ are endpoints of edge $e=uv$. The degree of a vertex $v$ on the graph $G$ is the number of vertices adjacent to the vertex $v$. In this study, the topic of graphs is vertex coloring will be studied. Coloring of a graph is giving color to the elements in the graph such that each adjacent element must have a different color. Vertex coloring in graph $G$ is assigning color to each vertex on graph $G$ such that the adjecent vertices $u$ and $v$ have different colors. The minimum number of colorings produced to color a vertex in a graph $G$ is called the vertex chromatic number in a graph $G$ denoted by $chi(G)$.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127340347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pewarnaan Pelangi Antiajaib pada Amalgamasi Graf","authors":"Riniatul Nur Wahidah, Dafik Dafik, E.R Albirri","doi":"10.25037/cgantjma.v3i1.76","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.76","url":null,"abstract":"Let $G$ is a connected graph with vertex set $V(G)$ and edge set $E(G)$. The side weights for $uvin E(G) $ bijective function $f:V(G)rightarrow{1,2,dots, |V(G)|}$ and $ w(uv)= f(u)+f(v) $ . If each edge has a different weight, the function $f$ is called an antimagic edge point labeling. Is said to be a rainbow path, if a path $P$ on the graph labeled vertex $G$ with every two edges $ ,u'v'in E(P) $ fulfill $ w(uv)neq w(u'v') $. If for every two vertices $u,v in V(G)$, their path $uv$ rainbow, $f$ is called the rainbow antimagic labeling of the graph $G$. Graph G is an antimagic coloring of the rainbow if we for each edge $uv$ weight color side $w(uv)$. The smallest number of colors induced from all sides is the rainbow antimagic connection number $G$, denoted by $rac(G)$. This study shows the results of the rainbow antimagic connection number from amalgamation graph.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129443849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pengembangan Perangkat Pembelajaran RBL-STEM Untuk Meningkatkan Metaliterasi Siswa Menerapkan Konsep Relasi Fungsi Dalam Menyelesaikan Masalah Dekorasi Teselasi Wallpaper","authors":"Sufirman Sufirman, D. Dafik, Arif Fatahillah","doi":"10.25037/cgantjma.v3i1.69","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.69","url":null,"abstract":"Dalam menyelesaikan persoalan matematika, terlebih yang mengintegrasikan permasalahan di kehidupan sehari hari diperlukan kemampuan metaliterasi siswa. Metaliterasi merupakan kerangka berpikir yang menyeluruh dan menjadi sumber referensi mandiri yang bersifat luas dibandingkan dengan jenis literasi lainnnya. Kemampuan metaliterasi siswa saat ini dapat dibilang rendah karena masih tergolong baru dan pembelajaran belum sepenuhnya menggunakan Internet of Things dalam pelaksanaannya. Oleh karena itu, dalam penelitian ini menggunakan model pembelajaran Research Based Learning dengan pendekatan STEM yang berfokus pada pemecahan masalah dekorasi teselasi wallpaper. Pada permasalahan ini, siswa merepresentasikan model dekorasi wallpaper kedalam bentuk titik dan garis untuk menemukan kombinasi warna yang sesuai. Selanjutnya dengan menggunakan konsep relasi fungsi, siswa dapat menemukan pola pewarnaan dari dekorasi tersebut. Dalam kegiatan pembelajaran, permasalahan STEM yang diangkat akan dikembangkan framework integrasi RBL-STEM untuk meningkatkan metaliterasi siswa. Hasil penelitian yang diperoleh berupa sintaks baru yang efektif dalam memecahkan permasalahan teselasi wallpaper dengan model RBL-STEM yang melibatkan relasi fungsi, perangkat pembelajaran RBL-STEM dan potret fase kemampuan metaliterasi siswa","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128128852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Tangga","authors":"Rizki Aulia Akbar, D. Dafik, R. M. Prihandini","doi":"10.25037/cgantjma.v3i1.72","DOIUrl":"https://doi.org/10.25037/cgantjma.v3i1.72","url":null,"abstract":"Let a simple and connected graph $G=(V,E)$ with the vertex set $V(G)$ and the edge set E(G). If there is a mapping $f$: $V(G)$ $rightarrow$ ${0,2,…,2k_v}$ and $f$: $E(G)$ $rightarrow$ ${1,2,…,k_e}$ as a function of vertex and edge irregularities labeling with $k=max$ ${2k_v,k_e}$ for $k_v$ and $k_e$ natural numbers and the associated weight of vertex $u,v in V(G)$ under $f$ is $w(u)=f(u)+sum_{u,vin E(G)}f(uv)$. Then the function $f$ is called a local vertex irregular reflexive labeling if every adjacent vertices has distinct vertex weight. When each vertex of graph $G$ is colored with a vertex weight $w(u,v)$, then graph $G$ is said to have a local vertex irregular reflexive coloring. Minimum number of vertex weight is needed to color the vertices in graf $G$ such that any adjacent vertices are not have the same color is called a local vertex irregular reflexive chromatic number, denoted by $chi_{(lrvs)}(G)$. The minimum $k$ required such that $chi_{(lrvs)}(G)=chi(G)$ where $chi(G)$ is chromatic number of proper coloring on G is called local reflexive vertex color strength, denoted by $lrvcs(G)$. In this paper, we will examine the local reflexive vertex color strength of local vertex irregular reflexive coloring on the family of ladder graph.","PeriodicalId":305608,"journal":{"name":"CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128160624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}