cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
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,
Computer Science & IT Other
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
Arjuna Subject : Matematika - Matematika Diskrit dan Kombinatori
Articles 52 Documents
 2   3   4   5   6 
Analisis rainbow vertex connection pada beberapa graf khusus dan operasinya Ida Ariska; Ika Hesti Agustin; Kusbudiono Kusbudiono
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.78

Abstract

The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected. On this research, will be raised the issue of how to produce graphs the results of some special graph and how to find the rainbow vertex connection. Operation that use cartesian product, crown product, and shackle. Theorem in this research rainbow vertex connection number in graph the results of operations Wd3,m □ Pn,,Wd3,m ⵙ Pn, and shack(Btm,v,n).
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.
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.
Perbandingan Metode Extended Kalman Filter dan Ensamble Kalman Filter dalam Mengestimasi Pertumbuhan Sel Kanker dengan Pengobatan Virus Oncolytic Rifki Ilham Baihaki; Didik Khusnul Arif; Erna Apriliani
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

Abstract

Virus is a microorganism that can spread and infect living cells, such as humans, animals, and plants. Not all viruses have negative effects, as in the case of oncolytic viruses. This type of virus is modified to infect and kill cancer cells. The success of cancer therapy using this virus depends on the pattern of interaction between the virus population and cancer cells, which can be described by a mathematical model. This research uses two methods to estimate the growth of cancer cells with oncolytic virus therapy, namely the Extended Kalman Filter (EKF) and the Ensemble Kalman Filter (EnKF). The results show that EKF has a faster computation time compared to EnKF. However, the EKF estimation results are still inferior to those of EnKF.
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).

Page 5 of 6 | Total Record : 52

 2   3   4   5   6 

Filter by Year

2020 2023


Reset
Filter By Issues
All Issue Vol 4, No 1 (2023): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 2 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 1 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS