Article Per Year (5 Year)
p-Index From 2021 - 2026
2.813
P-Index
This Author published in this journals
All Journal Jurnal Edukasi Universitas Jember KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi EDU-MAT: Jurnal Pendidikan Matematika Unisda Journal of Mathematics and Computer Science (UJMC) JTAM (Jurnal Teori dan Aplikasi Matematika) Warta Pengabdian JURNAL AXIOMA : Jurnal Matematika dan Pembelajaran JPKMI (Jurnal Pengabdian Kepada Masyarakat Indonesia) Contemporary Mathematics and Applications (ConMathA) Jurnal Ilmu Pendidikan Sekolah Dasar CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS JAMAIKA: Jurnal Abdi Masyarakat Pancaran Pendidikan
Robiatul Adawiyah
Program Studi Pendidikan Matematika, Universitas Jember, Jember, Indonesia
Agriculture, Biological Sciences & Forestry Humanities Chemistry Computer Science & IT Economics, Econometrics & Finance Education Environmental Science Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Physics Public Health Social Sciences Other

Published : 22 Documents Claim Missing Document
Claim Missing Document
Check
Articles

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

 1 
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

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

Abstract

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.
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 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 Antonius Cahya Prihandoko Arika Indah Kristiana Arika Indah Kristiana D. Dafik Dafik Elsa Yuli Kurniawati Ermita Rizki Albirri Ermita Rizki Albirri I Made Tirta Indi Izzah Makhfduloh Inge Wiliandani Setya Putri Khilyah Munawaroh Lioni Anka Monalisa, Lioni Anka Muhammad Gufronil Halim Muhammad Lutfi Asy’ari Mutiara Bilqis Nabilah Ayu Az-Zahra Nuwaila Izzatul Muttaqi Prihandini, Rafiantika Megahniah Pujiyanto, Arif Qurrota A'yuni Ar Ruhimat Qurrotul A’yun Rafelita Faradila Sandi Rafiantika Megahnia Rafiantika Megahnia Prihandini Rafiantika Megahniah Prihandini Reza Ambarwati Ridho Alfarisi S Slamin Saddam Hussen Slamin Slamin Slamin Susanto Susanto Tawakal, Anzori Zainur Rasyid Ridlo