Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

7.635

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 : 247 Documents Claim Missing Document

Claim Missing Document

Articles

11 12 13 14 15

Implementation of super H-antimagic total graph on establishing stream cipher Antonius Cahya Prihandoko; D. Dafik; Ika Hesti Agustin
Indonesian Journal of Combinatorics Vol 3, No 1 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

This paper is aimed to study the use of super (a, d)-H antimagic total graph on generating encryption keys that can be used to establish a stream cipher. Methodology to achieve this goal was undertaken in three steps. First of all the existence of super (a, d)-H-antimagic total labeling was proven. At the second step, the algorithm for utilizing the labeling to construct a key stream was developed, and finally, the mechanism for applying the key to establish a stream cipher was constructed. As the result, according to the security analysis, it can be shown that the developed cryptographic system achieve a good security.

On r-dynamic coloring of some graph operations Ika Hesti Agustin; D. Dafik; A. Y. Harsya
Indonesian Journal of Combinatorics Vol 1, No 1 (2016)
Publisher : Indonesian Combinatorial Society (InaCombS)

Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices receive different colors. An $r$-dynamic $k$-coloring is a proper $k$-coloring $c$ of $G$ such that $|c(N (v))| \geq 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 \in S\}$ for a vertex subset $S$ . The $r$-dynamic chromatic number, written as $\chi_r(G)$, is the minimum $k$ such that $G$ has an $r$-dynamic $k$-coloring. Note that the $1$-dynamic chromatic number of graph is equal to its chromatic number, denoted by $\chi(G)$, and the $2$-dynamic chromatic number of graph has been studied under the name a dynamic chromatic number, denoted by $\chi_d(G)$. By simple observation it is easy to see that $\chi_r(G)\le \chi_{r+1}(G)$, however $\chi_{r+1}(G)-\chi_r(G)$ can be arbitrarily large, for example $\chi(Petersen)=2, \chi_d(Petersen)=3$, but $\chi_3(Petersen)=10$. Thus, finding an exact values of $\chi_r(G)$ is significantly useful. In this paper, we will show some exact values of $\chi_r(G)$ when $G$ is an operation of special graphs.

Local antimagic vertex coloring of unicyclic graphs Nuris Hisan Nazula; S Slamin; D Dafik
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

The local antimagic labeling on a graph G with ∣V∣ vertices and ∣E∣ edges is defined to be an assignment f : E → {1, 2, ⋯, ∣E∣} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u) ≠ w(v) where w(u) = Σe ∈ E(u)f(e) and E(u) is the set of edges incident to u. Therefore, any local antimagic labeling induces a proper vertex coloring of G where the vertex u is assigned the color w(u). The local antimagic chromatic number, denoted by χla(G), is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, we present the local antimagic chromatic number of unicyclic graphs that is the graphs containing exactly one cycle such as kite and cycle with two neighbour pendants.

Pewarnaan Titik r-Dinamis pada Graf Hasil Operasi Edge Corona Adelia Putri Liowardani; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

This research is a development of research on $r$-dynamic vertex coloring on simple, connected, and undirected graphs. The $r$dynamic vertex coloring on the graph $G$ is the $r$ point coloring of the $r$ graph so that the vertices of degree two on the $G$ graph have at least two different color neighbors. The $r$-dynamic vertex coloring is satisfied if it meets the conditions for $\forall v \in V(G)$, $|c(N(v))|$ $\geq$ min$\{r,d(v)\}$. The chromatic number for the $r$-dynamic vertex coloring of the graph $G$ is denoted as $\chi_r(G)$. In this study, we discuss the $r$-dynamic vertex coloring on the graph resulting from the \emph{edge corona} operation on a path graph with a complete graph, a star graph, and a sweep graph. It is denoted that the result of the operation of \emph{edge corona} graph $G$ and graph $H$ is $G \diamond H$. In this study, the results of the $r$-dynamic vertex coloring are described in the operation graph $P_n \diamond K_m$, $P_n \diamond S_m$, $P_n \diamond P_m$, and $P_n \diamond B_{(m,k)}

On the Domination Number of Some Graph Operations N Y. Sari; I H. Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

A set D of vertices of a simple graph G, that is a graph without loops and multiple edges, is called a dominating set if every vertex u ∈ V (G) − D is adja-cent to some vertex v ∈ D. The domination number of a graph G, denoted by γ(G), is the order of a smallest dominating set of G. A dominating set D with |D| = γ(G) is called a minimum dominating set. This research aims to char-acterize the domination number of some graph operations, namely joint graphs, coronation of graphs, graph compositions, tensor product of two graphs, and graph amalgamation. The results shows that most of the resulting domination numbers attain the given lower bound of γ(G). Keywords: Dominating set, domination number,

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.

Analysis Creative Thinking Pattern on X Sains 2 at SMAN 2 Jember to Solving Open Ended Problem of Space and Shape Elsa Yuli Kurniawati; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Math learning to train people to think critically, creatively, logical, analytical and systematic. In reality, mathematics is often regarded as the science that emphasizes logical thinking with a unique solution and certainly, so that students do not have the flexibility to develop creative ideas. The condition causes low creativity of students in learning mathematics. Curriculum 2006 stated that creative thinking skills needed to master the science of the future, given that today's science and technology is developing very rapidly \cite{BSNP}. Thus, the ability to think creatively is important to develop. This study describes the rate and the process of creative thinking class X IPA 2 SMA Negeri 2 Jember, in solving open ended problems. Instruments used in this research is to test the ability to think creatively package A and package B, questionnaires and interview guidelines. Of the 36 students of class X IPA 2 SMA Negeri 2 Jember included TBK 0 (not creative) as much as two students (5.56\%), TBK 1 (less creative) as many as twenty students (55.56\%), TBK 2 (enough creative) thirteen students (36.1\%), TBK 3 (creative) only one student (2.78\%) and no students were able to achieve TBK 4 (very creative). Because there are only four levels of creative thinking then taken four students as research subjects who identified the creative thinking process. Students TBK 3 very fulfilling to aspects of fluency and flexibility aspects, but for the novelty aspect is still lacking. Students TBK 2 only meet the flexibility aspect alone. Students TBK 1 which fulfills the eloquence alone. Students who do not meet the TBK 0 fluency aspect, the aspect of flexibility and novelty aspect.

Chromatics Number of Operation Graphs Kiki Kurdianto; Ika Hesti Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Let G = (V (G); E(G)) be connected nontrivial graph. Edge coloring is de-¯ned as c : E(G) ! f1; 2; :::; kg; k 2 N, with the conditions no edges adja-cent having the same color. Coloring k-color edges r-dynamic is edges color-ing as much as k color such that every edges in E(G) with adjacent at least minfr; d(u) + d(v) ¡ 2g have di®erent color. An Edge r dynamic is a proper c of E(G) such that jc(N(uv))j = minfr; d(u) + d(v) ¡ 2g, for each edge N(uv) is the neighborhood of uv and c(N(uv)) is color used to with adjacent edges of uv. the edge r-dynamic chromatic number, written as ¸(G), is the minimum k such that G has an edge r-dynamic k-coloring. chromatic number 1-dynamic writ-ten as ¸(G), chromatic number 2-dynamic written as ¸d(G) And for chromatic number r-dynamic written as ¸(G). A graph is used in this research namely gshack(H3; e; n), amal(Bt3; v; n) and amal(S4; v; n). Keywords: r-dynamic coloring, r-dynamic chromatic number, graph operations.

Analisa Pewarnaan Total r-Dinamis pada Graf Lintasan dan Graf Hasil Operasi Desi Febriani Putri; Dafik Dafik; Kusbudiono Kusbudiono
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 1 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Graph coloring began to be developed into coloring dynamic. One of the developments of dynamic coloring is $r$-dynamic total coloring. Suppose $G=(V(G),E(G))$ is a non-trivial connected graph. Total coloring is defined as $c:(V(G) \cup E(G))\rightarrow {1,2,...,k}, k \in N$, with condition two adjacent vertices and the edge that is adjacent to the vertex must have a different color. $r$-dynamic total coloring defined as the mapping of the function $c$ from the set of vertices and edges $(V(G)\cup E(G))$ such that for every vertex $v \in V(G)$ satisfy $|c(N(v))| = min{[r,d(v)+|N(v)|]}$, and for each edge $e=uv \in E(G)$ satisfy $|c(N(e))| = min{[r,d(u)+d(v)]}$. The minimal $k$ of color is called $r$-dynamic total chromatic number denoted by $\chi^{\prime\prime}(G)$. The $1$-dynamic total chromatic number is denoted by $\chi^{\prime\prime}(G)$, chromatic number $2$-dynamic denoted with $\chi^{\prime\prime}_d(G)$ and $r$-dynamic chromatic number denoted by $\chi^{\prime\prime}_r(G)$. The graph that used in this research are path graph, $shackle$ of book graph $(shack(B_2,v,n)$ and \emph{generalized shackle} of graph \emph{friendship} $gshack({\bf F}_4,e,n)$.

Bilangan Kromatik Graceful pada Keluarga Graf Unicyclic Nafisa Afwa Sania; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Suppose $ G $ is a graph, where $ G = \{V (G), E (G) \} $. Graceful coloring is defined by $ c: V (G) \to \{1,2, ..., k \} $ which induces a proper edge coloring $ c': E (G) \to \{1,2, ..., k- 1 \}$ defined by $c'(xy)=|c(x)-c(y)|$, where $ k \geq 2 $, $ k \in N $. Coloring is said to be graceful if these 3 conditions are satisfied, namely the proper vertex color, the proper edge color, and the edge color, which are the absolute difference between the color of the accident vertex. The subgraph $H$ on that graceful coloring is smaller than the $G$. Furthermore, one of the subgraphs in the unicyclic graph family is a cycle graph. The graceful chromatic number on a graph denoted by $ \chi_g (G) $, is the optimum number of graceful colors from graph $G$. This research aims to find graceful chromatic numbers in the unicyclic graph family, namely bull graphs, net graphs, cricket graphs, caveman graphs, peach graphs, and flowerpot graphs. The results of this study indicate that $\chi_g(C_l) \geq 4$, where $C_l$ is a 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 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 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

Found 247 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 247 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 247 Documents
Search