Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

7.956

P-Index

This Author published in this journals

All Journal International Journal of Electrical and Computer Engineering Jurnal Ilmu Dasar Jurnal Edukasi Universitas Jember KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi Tadris: Jurnal keguruan dan Ilmu Tarbiyah Saintifika Prosiding Seminar Matematika dan Pendidikan Matematik UNEJ e-Proceeding Al-Jabar : Jurnal Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Indonesian Journal of Combinatorics Al-Khwarizmi: Jurnal Pendidikan Matematika dan Ilmu Pengetahuan Alam Jurnal Riset Pendidikan dan Inovasi Pembelajaran Matematika (JRPIPM) Jurnal Pengabdian Masyarakat Khatulistiwa Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pancaran Pendidikan SAINTIFIKA Jurnal Pengabdian Masyarakat Bangsa JDIME: Journal of Development and Innovation in Mathematics Education

D. Dafik

Universitas Jember, Indonesia

Author-ID : 488491

Religion Agriculture, Biological Sciences & Forestry Arts Humanities Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Mechanical Engineering Medicine & Pharmacology Nursing Physics Public Health Social Sciences Transportation Other

Published : 249 Documents Claim Missing Document

Claim Missing Document

Articles

Title

1 2 3 4 5

On r-Dynamic Coloring for Graph Operation of Cycle, Star, Complete, and Path Desy Tri Puspasari; Dafik Dafik; Slamin Slamin
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

For integer k, r > 0, (k, r) -coloring of graph G is a proper coloring on the vertices of G by k-colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{d(v), r} diﬀerent color. By a proper k -coloring of graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices are diﬀerent color. An r -dynamic k -coloring is a proper k -coloring c of G such that |c(N (v))| ≥ min{r, d(v)} for each vertex v in V (G), where N (v) is the neighborhood of v and c(S) = {c(v) : v ∈ S} for a vertex subset S . The r-dynamic chromatic number, written as χr (G), is the minimum k such that G has an r-dynamic k-coloring. Note the 1-dynamic chromatic number of graph is equal to its chromatic number, denoted by χ(G), and the 2-dynamic chromatic number of graph denoted by χd (G). By simple observation with a greedy coloring algorithm, it is easy to see that χr (G) ≤ χr+1(G), however χr+1(G) − χr (G) does not always have the same diﬀerence. Thus finding an exact values of χr (G) is significantly useful. In this paper, we investigate the some exact value of χr (G) when G is for an operation product of cycle, star, complete, and path graphs.

Analisis Rainbow Vertex Connection pada Beberapa Graf Khusus dan Operasinya Ida Ariska; Dafik Dafik; Ika Hesti Agustin
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 1 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Suppose $G=(V(G),E(G))$ is a non-trivial connected graph with edge coloring defined as $c:E(G) \rightarrow \{1,2,...,k\} ,k \in N$, with the condition that neighboring edges can be the same color. An original path is {\it rainbow path} if there are no two edges in the path of the same color. The graph $G$ is called rainbow connected if every two vertices in $G$ with rainbow path in $G$. The coloring here is called rainbow coloring, and the minimal coloring in a graph $G$ rainbow connection number is denoted by $rc(G)$. Suppose $G=(V(G),E(G))$ is a non-trivial connected graph with a vertex coloring defined as $c':V(G) \rightarrow \{1,2,...,k\},k \in N$, with the condition that neighboring interior vertex may have the same color. An original path is rainbow vertex path if there are no two vertices in the path of the same color. The graph $G$ is called rainbow vertex connected if every two vertices in $G$ with rainbow vertex path in $G$. The $G$ coloring is called rainbow vertex coloring, and the minimal coloring in a $G$ graph is called rainbow vertex connection number which is denoted by $rvc(G)$. This research produces rainbow vertex connection number on the graph resulting from the operation \emph{amal}($Bt_{m}$, $v$, $n$), $Wd_{3,m}$ $\Box$ $ P_n$, $P_m$ $\odot$ $Wd_{3,n}$, $Wd_{3,m}$ $+$ $C_n$, and \emph{shack}($Bt_{m}$, $v $, $n$).

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.

Analysis Super (a; d)-S3 Antimagic Total Dekomposition of Helm Graph Connektive for Developing Ciphertext Kholifatur Rosyidah; Dafik Dafik; Susi Setiawani
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Covering of G is H = fH1; H2; H3; :::; Hkg subgraph family from G with every edges on G admit on at least one graph Hi for a i 2 f1; 2; :::; kg. If every i 2 f1; 2; :::; k g, Hi isomorphic with a subgraph H, then H said cover-H of G. Furthermore, if cover-H of G have a properties is every edges G contained on exactly one graph Hi for a i 2 f1; 2; :::; kg, then cover-H is called decomposition-H. In this case, G is said to contain decomposition-H. A graph G(V; E) is called (a; d)-H total decomposition if every edges E is sub graph of G isomorphic of H. In this research will be analysis of super (a; d)-S3 total decomposition of connective helm graph to developing ciphertext.Key Word : Super (a; d)-S3, Dekomposisi, Graf helm, dan Ciphertext

Pewarnaan Titik pada Keluarga Graf Sentripetal Istamala Idha Retnoningsih; Dafik Dafik; Saddam Hussen
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

The graph $G$ is defined as a pair of sets $(V,E)$ denoted by $G=(V,E)$, where $V$ is a non-empty vertex set and $E$ is an edge set may be empty connecting a pair of vertex. Two vertices $u$ and $v$ in the graph $G$ are said to be adjacent if $u$ and $v$ are endpoints of edge $e=uv$. The degree of a vertex $v$ on the graph $G$ is the number of vertices adjacent to the vertex $v$. In this study, the topic of graphs is vertex coloring will be studied. Coloring of a graph is giving color to the elements in the graph such that each adjacent element must have a different color. Vertex coloring in graph $G$ is assigning color to each vertex on graph $G$ such that the adjecent vertices $u$ and $v$ have different colors. The minimum number of colorings produced to color a vertex in a graph $G$ is called the vertex chromatic number in a graph $G$ denoted by $\chi(G)$.

Pewarnaan Ketakteraturan Lokal Inklusif pada Keluarga Graf Pohon Tree Umi Azizah Anwar; Arika Indah Kristiana; Arif Fatahillah; Dafik Dafik; Ridho Alfarisi
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 1 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

All graph in this paper is a simple and connected graph. We define $l: V(G) \to \{ 1, 2, 3,...k\} $ is called vertex irregular k-labeling and $w: (G) \to N$ the weight function with $[\sum_{u \epsilon N} l(u) + l(v) ]$. A local irregularity inclusive coloring if every $u, v \epsilon E(G), w(u) \ne w(v) $ and $max (l) = min \{ max (l_i), l_i label function\}$. The chromatic number of local irregularity inclusive coloring of $G$ denoted by $\chi_{lis}^{i}$, is the minimum cardinality of local irregularity inclusive coloring. We study about the local irregularity inclusive coloring of some family tree graph and we have found the exact value of their chromatic number.

Pengembangan Affine Chiper dalam Pelabelan Super Antiajaib Graf Buku Bersusun Menggunakan Pemrograman Matlab Vutikatul Nur Rohmah; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Super $(a, d)-\mathcal{H}-$ antimagic total covering labeling on a graph $G=(V,E)$ is total labelling $\lambda$ on $V(G)UE(G)$ to set integers $\{1,2,3,..., |V(G)UE(G)|\}$ form an arithmetic sequence $\{a, a+d, a+2d, . . .,a+(s-1)d\}$ where $a, d$ are positive integer with $a$ is firt integer, $d$ is different, and $s$ is sum of covering. This research purposes to determine cardinality of vertex, cardinality of edge, upper limit of difference value, difference value from shackle of stacked book graph.The first step is determine cardinality of vertex and cardinality of edge on shackle of stacked book graph. Then determine upperlimit if difference value and the partition from labeling on shackle of stacked book graph. So that be produced super $(a, d)-\mathcal{H}-$antimagic total covering labeling on shackle of stacked book

Super (a; d)-edge Antimagic Total Labeling of Shack(F6; B2; n) Graph for Developing a Polyalphabetic Cryptosystem Arnasyitha Yulianti Soelistya; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

A graph G of order p and size q is called an (a; d)-edge-antimagic total if there exist a bijection f : V (G) [ E(G) ! f1; 2; : : : ; p + qg such that the edge-weights, w(uv) = f(u) + f(v) + f(uv); uv 2 E(G), form an arithmetic sequence with ¯rst term a and common di®erence d. Such a graph is called super if the smallest possible labels appear on the vertices. In this paper we study a super edge-antimagic total labeling of Shackle (F6; B2; n) Graph connected and we will use it to develop a polyalphabetic cryptosystem.

Pengembangan Perangkat Pembelajaran RBL-STEM Untuk Meningkatkan Metaliterasi Siswa Menerapkan Konsep Relasi Fungsi Dalam Menyelesaikan Masalah Dekorasi Teselasi Wallpaper Sufirman Sufirman; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Dalam menyelesaikan persoalan matematika, terlebih yang mengintegrasikan permasalahan di kehidupan sehari hari diperlukan kemampuan metaliterasi siswa. Metaliterasi merupakan kerangka berpikir yang menyeluruh dan menjadi sumber referensi mandiri yang bersifat luas dibandingkan dengan jenis literasi lainnnya. Kemampuan metaliterasi siswa saat ini dapat dibilang rendah karena masih tergolong baru dan pembelajaran belum sepenuhnya menggunakan Internet of Things dalam pelaksanaannya. Oleh karena itu, dalam penelitian ini menggunakan model pembelajaran Research Based Learning dengan pendekatan STEM yang berfokus pada pemecahan masalah dekorasi teselasi wallpaper. Pada permasalahan ini, siswa merepresentasikan model dekorasi wallpaper kedalam bentuk titik dan garis untuk menemukan kombinasi warna yang sesuai. Selanjutnya dengan menggunakan konsep relasi fungsi, siswa dapat menemukan pola pewarnaan dari dekorasi tersebut. Dalam kegiatan pembelajaran, permasalahan STEM yang diangkat akan dikembangkan framework integrasi RBL-STEM untuk meningkatkan metaliterasi siswa. Hasil penelitian yang diperoleh berupa sintaks baru yang efektif dalam memecahkan permasalahan teselasi wallpaper dengan model RBL-STEM yang melibatkan relasi fungsi, perangkat pembelajaran RBL-STEM dan potret fase kemampuan metaliterasi siswa

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.

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

Title Search

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

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

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