Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

1.288

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 BAREKENG: Jurnal Ilmu Matematika dan Terapan Unisda Journal of Mathematics and Computer Science (UJMC) Contemporary Mathematics and Applications (ConMathA) CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Ermita Rizki Albirri

Universitas Jember

Author-ID : 2974998

Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Energy Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Transportation Other

Published : 14 Documents Claim Missing Document

Claim Missing Document

Articles

Title

Rainbow Vertex Connection Number pada Keluarga Graf Roda Firman Firman; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path 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 which is denoted $rvc(G)$. The result of the research are the rainbow vertex connection number of family wheel graphs.

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.

Resolving Domination Number pada Keluarga Graf Buku Quthrotul Aini Fuidah; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

All graph in this paper are members of family of book graph. Let $G$ is a connnected graph, and let $W = \{w_1,w_2,...,w_i\}$ a set of vertices which is dominating the other vertices which are not element of $W$, and the elements of $W$ has a different representations, so $W$ is called resolving dominating set. The minimum cardinality of resolving dominating set is called resolving domination number, denoted by $\gamma_r(G)$. In this paper we obtain the exact values of resolving dominating for family of book graph.

Dimensi Metrik Sisi Pada Beberapa Graf Unicyclic Bayu Aprilianto; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

All the graphs in this paper are connected graphs and $d(e,v)$ is the length of the shortest path between $e=uv$ and $v$. 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$. The edge metric dimension is a topic that is closely related to the cardinality of the distance of each edge on the graph $G$ with respect to the resolving set $W$ which is denoted by $dim_E(G)$. Let if the subset of vertex $W=\{w_1,w_2,w_3,...,$ $w_k\}$, then the representation of the distance of the $uv$ edge to the set of differences is k-tuple $r(uv|W)=(d(uv,w_1),d(uv,w_2),d(uv,w_3),...,d(uv,w_k)$. A unicyclic graph is one that only has exactly one cycle. In this paper, we will study edge metric dimensions on some families of unicyclic graphs.

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

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.

Co-Authors Afni, Anis Nur Ambarwati, Reza Arika Indah Kristiana Bayu Aprilianto D. Dafik Dafik Dafik Deddy Setyawan Firman Firman Husain, Sharifah Kartini Said Khilyah Munawaroh Quthrotul Aini Fuidah Rafiantika Megahnia Prihandini Reza Ambarwati Riniatul Nur Wahidah Riniatul Nur Wahidah Robiatul Adawiyah S Slamin Sharifah Kartini Said Husain Surya Indriani Wahidah, Riniatul Nur

Title Search

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

Abstract

Abstract

Abstract

Abstract

Abstract

Title

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