Garuda - Garba Rujukan Digital

Article Per Year (5 Year)

All

CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

cgant
Website

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 8 Documents

Search results for , issue "Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS" : 8 Documents clear

Pengembangan Media Pembelajaran Berbasis TI pada Materi Penyajian Data Kelas VII untuk Meningkatkan Hasil Belajar Dinar Dwi Yuliyanti; Arika Indah Kristiana; Lioni Anka Monalisa
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

The development of technology has a very big influence in various fields of human life, especially in the field of education. One of its uses is as a tool in the learning process. Technology-based learning can make learning more interesting, effective and efficient, so that students are more enthusiastic about learning and easy to understand the material presented. The model used is the Thiagarajan or 4-D model which consists of four stages, namely the define, design, develop, and dissenimante stages. There are three data collection techniques carried out in this study, namely validity, obtained through validation by the validator; practicality, obtained from media user response questionnaires by students; effectiveness, obtained through the results of student learning tests after using the media. The results showed that the correlation coefficient with a valid interpretation was very high at 0.94. The results of the media user response questionnaire with a percentage of 88.25%. The results of the learning test with a percentage of completeness reaching 85.18% indicate that the learning media can be categorized as effective.

Analisa Himpunan Dominasi Lokasi pada Model Topologi Graf Khusus dan Operasinya Reyka Bella Desvandai; Ika Hesti Agustin; Kusbudiono Kusbudiono
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Misalkan $G=(V,E)$ adalah graf sederhana tidak berarah dan terhubung dengan himpunan titik $V$ dan himpunan sisi $E$. Himpunan $D\in V(G)$ dikatakan himpunan dominasi lokasi dari suatu graf terhubung $G$ jika setiap dua titik yang berbeda $u,v \in V(G)\ D$, $N(u)\cap D\neq N(v)\cap D$. Kardinalitas minimal dari himpunan dominasi lokasi disebut nilai himpunan dominasi lokasi dari graf $G$ yang disimbolkan dengan $\gamma_L(G)$. Penelitian ini menghasilkan nilai himpunan dominasi lokasi pada beberapa graf khusus dan operasinya.

Kajian Rainbow 2-Connected Pada Graf Eksponensial dan Beberapa Operasi Graf Herninda Lucky Oktaviana; Ika Hesti Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Let $G=(V(G),E(G))$ is a graph connected non-trivial. \textit{Rainbow connection} is edge coloring on the graph defined as $f:E(G)\rightarrow \{1,2,...,r|r \in N\}$, for every two distinct vertices in $G$ have at least one \textit{rainbow path}. The graph $G$ says \textit{rainbow connected} if every two vertices are different in $G$ associated with \textit{rainbow path}. A path $u-v$ in $G$ says \textit{rainbow path} if there are no two edges in the trajectory of the same color. The edge coloring sisi cause $G$ to be \textit{rainbow connected} called \textit{rainbow coloring}. Minimum coloring in a graph $G$ called \textit{rainbow connection number} which is denoted by $rc(G)$. If the graph $G$ has at least two \textit{disjoint rainbow path} connecting two distinct vertices in $G$. So graph $G$ is called \textit{rainbow 2-connected} which is denoted by $rc_2(G)$. The purpose of this research is to determine \textit{rainbow 2-connected} of some resulting graph operations. This research study \textit{rainbow 2-connected} on the graph (${C_4}^{K_n}$ and $Wd_{(3,2)}\square K_n$).

Nilai Ketidakteraturan Total Selimut pada Graf Yessy Eki Fajar Reksi; Dafik Dafik; Ika Hesti Agustin
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Misal $G$ dan $K$ adalah graf sederhana, nontrivial dan graf tak berarah. Operasi \emph{total comb product} menghasilkan graf baru dengan mengoperasikan dua buah graf. Misalkan \emph{G} dan \emph{K} adalah graf terhubung dan \emph{v} $\in$ \emph{V(K}) dan \emph{e} $ \in $ \emph{E(K)}. Operasi \emph{total comb product} dari graf \emph{G} dan \emph{K} yang dinotasikan ($G$ $\dot{\unrhd}$ $K$) merupakan operasi graf yang diperoleh dengan mengambil salinan satu graf \emph{G} dan $|V(G)|+|E(G)|$ salinan \emph{K}, kemudian merekatkan salinan ke-\emph{i} dari graf \emph{K} di titik cangkok \emph{v} pada titik ke-\emph{i} dari graf \emph{G} dan merekatkan salinan ke-\emph{j} dari graf \emph{K} di sisi cangkok \emph{e} pada sisi ke-\emph{j} dari graf \emph{G}. Pelabelan total didefinisikan suatu fungsi $f : V(G) \cup E(G) \rightarrow \{1,2,3,...,k\}$ merupakan pelabelan \emph{k-total} pada graf $G$. Pelabelan \emph{k-total} dikatakan pelabelan total ketidakteraturan selimut pada graf $G$ jika untuk $H \subseteq G$ dengan kata lain $H$ merupakan selimut dari suatu graf $G$, bobot total selimut $W(H)=\Sigma_{v\in V(H)}f(v)+\Sigma_{e\in E(H)}f(e)$ berbeda. Nilai minimum $k$ pada pelabelan total ketidakteraturan selimut disebut dengan \emph{total H-Irregularity Strength} dari suatu graf $G$ yang dinotasikan dengan $tHs(G)$. Pada artikel ini dilakukan penelitian tentang pelabelan total ketidakteraturan selimut yaitu mencari nilai ketidakteraturan total selimut pada graf hasil operasi \emph{total comb product} dari graf khusus.

Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic Khilyah Munawaroh; Arika Indah Kristiana; Ermita Rizki Albirri; Dafik Dafik; Robiatul Adawiyah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

In this research is a development of local irregularity vertex coloring of graph. The based on definition, as follows: \textbf{$l:V(G) \longrightarrow {\{1, 2, ..., k}\}$} is called vertex irregular k-labelling and \textbf{$w:V(G) \longrightarrow N$} where \textbf{$w(u) = \varSigma_{ v \in N(u)}l(v)$}, $w$ is called local irregularity vertex coloring. A condition for $w$ to be a local irregularity vertex coloring, If \textit{opt$(l)$ = min\{maks$(li); li$, vertex labelling function}, and for every \textbf{$u,v\in E(G),w(u)\ne w(v)$}. The chromatic number local irregularity vertex coloring is denoted by $\chi_{lis}(G)$. In this paper, the researchers will discuss of local irregularity vertex coloring of related unicyclic graphs and we have found the exact value of their chromatic number local irregularity, namely cricket graph, net graph, tadpole graph, \textit{peach} graph, and bull graph.

Analisis Gelombang Air Laut dengan Menggunakan Pemodelan Berbasis Matlab Zainur Rasyid Ridlo; Luthfin Afafa; Efrika Marsya Ulfa; Mawardani Adi Pratama Dewi; Siti Maimuna
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Waves are the propagation of energy from one place to another without dragging the material in its path. The waves on Papuma Beach are classified as technical waves because they require a medium to propagate and transfer the required energy. When the waves move at a certain height, the waves on Papuma Beach have a potential force. This potential force depends on the height of an object. When the waves on Papuma Beach get higher, it also has high potential energy. The method used in this research is the analysis of physical concepts related to the indigenous. Research method of analyzing the concept of physics, analyze the formulas and quantities used coding the MATLAB for making illustrations and to calculate the formulas. Potential energy is formulated with. The energy in the waves is a combination of kinetic energy and potential energyand thanproduce the formula.

Analisis Rainbow Antimagic Coloring Pada Hasil Operasi Comb Graf Lintasan Feby Suryandana
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

All the graphs in this paper are connected graphs. Let $G=(V,E)$ where $V(G)$ is a set of vertex from graph $G$ while $E(G)$ is a set of edge from graph $G$. A bijection function $f: V \rightarrow \{1,2,3,...,\lvert V(G)\rvert\}$ the associated weight of an edge $uv \in E(G)$ under $f$ is $W_f{(uv)}=f(u)+f(v)$. A path $P$ in a vertex-labeled graph $G$ is said to be a rainbow path if for every two edges $uv$, $u'v' \in E(P)$, there is $w_f{(uv)}\neq w_f{u'v'}$. If for every two vertices $u$ and $v$ of $G$, there is a rainbow $u$-$v$ path, then $f$ is called a rainbow antimagic labeling of $G$. A graph $G$ is rainbow antimagic if $G$ has a rainbow antimagic labeling. The minimum number of color needed to make $G$ rainbow connected, called rainbow antimagic connection number, denoted by rac(G). In this paper, we will analyze the rainbow antimagic coloring on comb product of path 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

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.

Page 1 of 1 | Total Record : 8

Filter by Year

2021 2021

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

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

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

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

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

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