Claim Missing Document
Check
Articles

Found 41 Documents
Search
Journal : CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Super (a; d)-H-Antimagic Total Covering of Triangular Cycle Ladder Graph for Developing Ciphertext Irma Azizah; Dafik Dafik; Slamin Slamin
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2818.788 KB) | DOI: 10.25037/cgantjma.v1i1.8

Abstract

A (a; d)-H-antimagic total covering is a total labeling dari V (G) [ E(G) to integer number f1; 2; 3; :::; jV (G) [ E(G)jg with condition, every subgraph A inP P PG isomorphic with subgraph H A = v2V (A) (v) + e2E(A) (e) on arith-metic sequence. A graph containing the labeling called super (a; d)-H-antimagic total covering. Furthermore , f (v)gv2V = f1; :::; jV jg, is called graph super H antimagic. In this research used triangular Cycle Ladder Graph T CLn of con-nective to developing ciphertext. Key Word : Super H antimagic total selimut, Triangular Cycle Ladder Graph T CLn, Ciphertexts.
Pewarnaan Pelangi Antiajaib pada Amalgamasi Graf Riniatul Nur Wahidah; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (496.647 KB) | DOI: 10.25037/cgantjma.v3i1.76

Abstract

Let $G$ is a connected graph with vertex set $V(G)$ and edge set $E(G)$. The side weights for $uv\in 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.
Pengembangan Perangkat Research-Based Learning dengan Pendekatan STEM dalam Meningkatkan Metaliterasi Peserta Didik Menyelesaikan Masalah Himpunan Pasangan Berurutan Excelsa Suli Wildhatul Jannah; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2780.465 KB) | DOI: 10.25037/cgantjma.v2i2.64

Abstract

The ability of metaliteracy is very important in the industrial era 4.0. Metaliteracy is a comprehensive framework of thinking that goes beyond other literacies with the main literacy being information literacy. It is indicated that the metaliteracy of students is still low, it is because this literacy is still relatively new. The use of the IoT in learning is also still uneven, including the learning model used by teachers has not been able to fully support the formation of this ability. Therefore, in this study, the Research-Based Learning model which is integrated with the STEM approach (Science, Technology, Engineering, Mathematics) will be applied to solve the STEM problem of flight scheduling. Students are introduced to the application in the form of a set of sequential pairs, then with the representation of the set of points and lines a specific schedule is drawn up and includes its generalizations. The next step is how to bring STEM problem solving in learning class, then the developed RBL and STEM tools in learning to improve students' metaliteracy. From the results of the study, it was found that the RBL device with the STEM approach developed met the valid, effective, and practice criteria.
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.
Penerapan Teknik Partisi Langkah Kuda Papan Catur pada Pelabelan Super (a,d)-P_2 (▷) ̇ H-Antimagic Total Covering Sebarang Dua Graf dan Aplikasinya A H Rahmatillah; I H Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

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

Abstract

Let  be a finite collection of simple, nontrivial and undirected graphs. A graph  is as antimagic total covering if there is bijectif  function  for every subgraph in which isomorfic to  and the total  weight,  form arithmetic sequence , in which a,b are integers and n is a number of graph cover of which the result of total comb product operation. A antimagic total covering  is as "super" if smallest label is used for vertex labelling. The way for labelling a graph this time, using a knight move partition techniques application. The graph use total comb product operation . Take a copy of  and a number  of , then put the  copy of -sequence in graph vertex  to -sequence vertex of  and put the  copy of -sequence in graft edge  to -sequence edge of  is definition of total comb product. In this article, will be investigated about Knight Move Partition Techniques Application in Labelling Super Antimagic Total Covering for Any Two Graphs and Its Application (in Constructing Ciphertext).
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.
Resolving Dominating Set pada Graf Bunga dan Graf Roda Nabilah Ayu Az-Zahra; Dafik Dafik; R M Prihandini
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 4, No 1 (2023): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

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

Abstract

All graphs in this paper are simple and connected graph. Let V (G) and E(G) bevertex set and edge set. A map f : .V (G) −→ {0, 2, ..., 2kv} and f : E(G) −→ {1, 2, ..., ke} are sind to be an irregular reflexive labelling where k = max{2kv, ke} for kv, ke are natural number. The weight of edge u, v ∈ E(G) under f is w(u) = f(u)+Σuv∈V (G)f(uv). 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 edgeWhen 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 χlrecs(G). Furthermore, the minimum k required such that χlrecs(G) = χ(G) is called a local reflexive edge color strength, denoted by lrecs(G). In this paper, we learn about the local edge irregular reflexive coloring and obtain lrecs(G) of planar related graphs.
Rainbow Connection pada Graf Siput, Graf Tunas Kelapa dan Graf Lotus Indi Izzah Makhfduloh; Dafik Dafik; R Adawiyah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 4, No 1 (2023): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

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

Abstract

Graph colouring is giving colour to a set of vertices and a set of edges on a graph. The condition for colouring a graph is that each colour is different for each neighbouring graph member. Graph colouring can be done by mapping a different colour to each vertex or edge. Rainbow colouring is part of the rainbow-connected edge colouring, where every graph G has a rainbow path. A rainbow path in graph G is formed if two vertices on graph G do not have the same colour. The minimum number of colours in a rainbow-connected graph is called the rainbow connection number denoted by rc(G). The graphs used in this study are the snail graph (Sn), the coconut shoot graph (CRn,m) and the lotus graph (Lon).
Co-Authors A Arynda A H Rahmatillah A. Y. Harsya Adawiyah, R Adelia Putri Liowardani Agnes Ika Nurvitaningrum, Agnes Ika Agrita Kanty Purnapraja, Agrita Kanty Agustina M. Agustina Muharromah, Agustina Ahmad Adi Ahmad Musyaffa' Hikamuddin Ahmad Syaiful Rizal, Ahmad Syaiful Aldyon Restu Azkarahman Alfian Futuhul Hadi Alfian Yulia Harsya, Alfian Yulia Alfin Nabila Taufik Alfiyantiningsih, Nur Amalina, Putri Nur Anindyta Anggirena Wulandari Anisa Meilinda Wardani Annadhifi, Muhammad Ilham Nurfaizi Antonius Cahya Prihandoko Arif Fatahillah Arika I. Kristiana Arika Indah Kriatiana Arika Indah Kristiana Arnasyitha Yulianti S, Arnasyitha Arnasyitha Yulianti Soelistya ArRuhimat, QurrotaA’yuniArRuhimat A’yuni Artanty Nastiti, Artanty Asari, Okta Endri Asy’ari, Muhammad Lutfi Awalin, Qonita Ilmi Aziza, Adinda Putri A’yun, Qurrotul Bawono, Darian Aji Bayu Aprilianto Brahmanto, Juanda Cangul, Ismail Naci Desak Made Dwika Saniriati Desi Febriani Putri Desi Febriani Putri Desy Tri Puspasari Desy Tri Puspasari, Desy Tri Devi Eka Wardani M, Devi Eka Dewi ANGGRAENI Dewy, Elitta P Dian Anita Hadi, Dian Anita Didik Sugeng Didin Trisnani, Didin Dina Tri Djoni Budi Sumarno Dliou, Kamal Dwi Agustin Retnowardani Dyna Probo Mukti Elok Asmaul Husna Elsa Yuli Kurniawati Elsa Yuli Kurniawati Endang Wahyuningrum Ermita R Albirri Ermita Rizki Albirri Ervin Eka Riastutik, Ervin Eka Ervin Oktavianingtyas Excelsa Suli Wildhatul Jannah Farah Rezita Nurtaatti, Farah Rezita Faruq, Fathulloh fatahillah, arief Fatoni, Muhamad Faizal Fia Cholidah, Fia Firdausiyah, Iftitahul Firman Firman Fitri Wulandari Gembong A. W. Hani'ah Zakin Harianto Setiawan, Harianto Hendry Dwi Saputro Herninda Lucky Oktaviana Hilmiyah Hanani Hobri Husain, Sharifah Kartini Said I H Agustin I H. Agustin I Ikhwandi I M Tirta I Made Tirta I Made Tirta Ida Ariska Ika Hesti A. Ika Hesti Agustin, Ika Hesti Ika Mareta Imanul Umar Hawari Imro’atun Rofikah Indar Setiani Indi Izzah Makhfduloh Inge Yosanda Arianti, Inge Yosanda Irma Azizah Irma Azizah, Irma Istamala Idha Retnoningsih Jackson P Mairing Jannah, Excelsa Suli Wildhatul Jesi Irwanto, Jesi Joni Susanto, Joni K Kasturi K Khasan, K Karinda Rizqy Aprilia, Karinda Rizqy Khilyah Munawaroh Kholifatu Rosyidah Kholifatur Rosyidah Khusnul, Agustina Hotimatus Kiki Kurdianto Kiswara Agung Santoso Kurniawati, Elsa Yuli Kusbudiono Kusbudiono, Kusbudiono Laili, Nuryatul Laily Anisa Nurhidayati Liliek Susilowati Liowardani, Adelia Putri Lubis Muzaki Lusia Dewi Minarti Lusia Dewi Minarti M. Wildan Athoillah Makhfudloh, I I Mardiyah, Fitriyatul Marsidi Marsidi Maylisa, Ika Nur Miftahur Roifah Millatuz Zahroh, Millatuz Moch. Avel Romanza P, Moch. Avel Romanza Mohammad Fadli Rahman Mohanapriya, N. Muhammad Lutfi Asy’ari Muhlisatul Mahmudah, Muhlisatul Mursyidah, Indah Lutfiyatul Murtini Murtini, Murtini N Maylisa N Y. Sari Nabilah Ayu Az-Zahra Nafisa Afwa Sania Nindya Laksmita Dewi, Nindya Laksmita Novalita Anjelia Novian Nur Fatihah Novita Cahya Mahendra Novita Sana Susanti Novri Anggraeni, Novri Nur Alfiyantiningsih Nur Asia Jamil, Nur Asia Nurcholif Diah Sri Lestari Nuris Hisan Nazula Nuwaila Izzatul Muttaqi O A Safiati O. A. Safiati Ojat Darojat Okti Anis Safiati Permatasari, Putri Ayu Pratiwi, Putri Indah Prihandini, R M Prihandini, Rafiantika Megahnia Prihandini, Rafiantika Megahniah Prihandini, RM Prihandoko, AC Prof. Dr.I Nengah Suparta,M.Si . Pujiyanto, Arif Putra Mahendratama Sasongko, Tito Putri Rizky H.P, Putri Rizky Q Qoriatul QurrotaA’yuniArRuhimat A’yuni ArRuhimat Qurrotul A’yun Quthrotul Aini Fuidah R M Prihandini R Ratih R Rohmatullah R. Humaizah Rafiantika M Rafiantika Megahnia Prihandini Rahmadani, M R Rahman, Md. Saidur Randhi N. Darmawan, Randhi N. Randi Pratama Murtikusuma Ratna Syafitri Reza Mega Ardhilia Ridho Alfarisi Ridho Alfarisi, Ridho Ridlo, Zainur Rasyid Riniatul Nur Wahidah Rizki Aulia Akbar Robiatul Adawiyah Robiatul Adawiyah Robiatul Adawiyah Rohini, A Rukmana Sholehah, Rukmana S Slamin S Suciati S Suharto S Sunardi S Susanto S. Chususiyah S. M. Yunika Saddam Hussen Safira Izza Ghafrina Safira Izza Ghafrina Saifudin, Ilham Saniriati, Desak Made Dwika Santoso, Aji Mansur Septory, Brian Juned Shapbian Novindasari, Shapbian Shela Okta Grefina, Shela Okta Sherly Citra Wuni, Sherly Citra Sholihah, Siti Mar’atus Sih Muhni Yunika, Sih Muhni Siska Aprilia Hardiyanti Siska Binastuti Siska Binastuti, Siska Siswono, Hendrik Siti Aminatus Solehah Siti Latifah Siti Mar’atus Sholihah Soleh Chudin Sri Tresnaningsih Sufirman Sufirman Sulistio, Wahyu Sullystiawati, Lusia Herni Sunder, R. Suntusia Suntusia Suparti Supratiningsih Supratiningsih Susanto Susanto Susanto Susanto Susi Setiawani Tanti Windartini, Tanti Tasrip Rudiono Thoyibah, Fifi Tommi Sanjaya Putra Toto Bara Setiawan Tri Dyah Prastiti Ulul Azmi Umi Azizah Anwar Venkatachalam, M. Viantasari, Erwinda Viqedina Rizky Noviyanti Vutikatul Nur Rohmah Wahidah, Riniatul Nur Wahyu Lestari Wahyu Nikmatus Sholihah Wardani, Putu Liana Weny Wijayanti, Weny Wicha Dwi Wicha Dwi Vikade, Wicha Dwi WIHARDJO, EDY Wijayanti, Elsy Y Yunita Yanuarsih, Elly Yessy Eki Fajar Reksi Yuli Kurniawati, Elsa Yuli Nur Azizah, Yuli Nur Z R Ridlo Zainur Rasyid Ridlo