Browsing LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah) by Author "DAFIK, Dafik"

Now showing items 21-40 of 69

    • The Implementation of research based learning in developing the students mathematical generalization thinking skills in solving a paving blocks design problem 

      MONALISA, Lioni Anka; DAFIK, Dafik; Y HASTUTI, Y Hastuti; HUSSEN, Saddam; OKTAVIANINGTYAS, Ervin (Series: Earth and Environmental Science, 2019-04-09)
      The mathematical generalization process is a powerful thinking skills that should be present in mathematical learning. Especially in the higher education students, the lecturer should maintain this process to sharp their ...

    • An Inclusive Local Irregularity Coloring of Graphs 

      KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho; ANWAR, Umi Azizah; CITRA, Sri Moeliyana (Advances in Mathematics: Scientific Journal, 2020)
      All graph in this paper are connected and simple. Let G = (V, E) be a simple graph, where V (G) is vertex set and E(G) is edge set. The local irregularity vertex coloring of G is l : V (G) → {1, 2, · · · , k} and w : V (G) ...

    • The Level Of Critical Thinking Skill On Solving Two-dimensional Arithmetics Problems Through Research-based Learning 

      SUNTUSIA, Suntusia; DAFIK, Dafik; HOBRI, Hobri (Jurnal Pendidikan dan Pembelajaran Matematika, 2021-06-01)
      Developing critical and collaborative thinking skills among learners was of significant importance in the 21st-century era. In this study, the researcher applied teaching and learning based on Research-Based Learning ...

    • The Local (Adjacency) Metric Dimension of Split Related Complete Graph 

      ADAWIYAH, Robiatul; DAFIK, Dafik; PRIHANDINI, Rafiantika Megahnia; ALBIRRI, Ermita Rizki; AGUSTIN, Ika Hesti; ALFARISI, Ridho (IOP Conf. Series: Journal of Physics: Conf. Series, 2019-04-01)
      Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called E(G) are two sets which form graph G. W is a local adjacency resolving set of G if for every two distinct vertices x, y and x adjacent ...

    • Local Antimagic r-dynamic Coloring of Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; AGUSTIN, Ika Hesti; ALFARISI, Ridho (IOP Conf. Series: Earth and Environmental Science 243 (2019) 012077, 2019-04-09)
      Let G = (V; E) be a connected graph. A bijection function f : E(G) ! f1; 2; 3; ; E(G)jg is called a local antimagic labeling if for all uv 2 E(G)s, w(u) 6= w(v), where w(u) = e2E(u)f(e). Such that, local antimagic ...

    • Local Distance Irregular Labeling of Graphs 

      KRISTIANA, Arika Indah; KRISTIANA, Arika Indah; ALFARISI, Ridho; DAFIK, Dafik (TWMS Journal of Applied and Engineering Mathematics, 2023)
      We introduce the notion of distance irregular labeling, called the local distance ir regular labeling. We define λ : V (G) −→ {1, 2, . . . , k} such that the weight calculated at the vertices induces a vertex coloring if ...

    • Local Irregular Vertex Coloring of Some Families Graph 

      KRISTIANA, Arika Indah; ALFARISI, Ridho; DAFIK, Dafik; AZAHRA, Nadia (Journal of Discrete Mathematical Sciences and Cryptography, (DOI : 10.1080/09720529.2020.1754541), 2020-06-09)
      All graph in this paper is connected and simple graph. Let d(u, v) be a distance between any vertex u and v in graph G = (V, E ). A function : ( ) l V G {1, 2, , } k →  is called vertex irregular k-labelling ...

    • Local Super Antimagic Total Labeling for Vertex Coloring of Graphs 

      SLAMIN, Slamin; ADIWIJAYA, Nelly Oktavia; HASAN, Muhammad Ali; DAFIK, Dafik; WIJAYA, Kristiana (Symmetry, 2020-11-07)
      Let G = (V, E) be a graph with vertex set V and edge set E. A local antimagic total vertex coloring f of a graph G with vertex-set V and edge-set E is an injective map from V [ E to {1, 2, ... , |V| + |E|} such that if ...

    • The Lower Bound of the r-Dynamic Chromatic Number of Corona Product by Wheel Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik (AIP Conf. Proc. 2014, 020054-1–020054-7, 2018-09-21)
      The dynamic coloring of a graph G is proper coloring such that every vertex of G with degree has at least two neighbors that are colored differently. A generalization of the dynamic coloring was also introduced by Montgomery ...

    • Metric Chromatic Number of Unicyclic Graphs 

      ALFARISI, Ridho; KRISTIANA, Arika Indah; ALBIRRI, Ermita Rizki; ADAWIYAH, Robiatul; DAFIK, Dafik (INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 06, JUNE 2019, 2019-06-09)
      All graphs in this paper are nontrivial and connected graph. Let 𝑓 ∶ 𝑉 (𝐺) → *1,2, … , 𝑘+ be a vertex coloring of a graph 𝐺where two adjacent vertices may be colored the same color. Consider the color classes Π = ...

    • Metric Dimension dan Non-Isolated Resolving Number pada Beberapa Graf 

      SHOLIHAH, Wahyu Nikmatus; DAFIK, Dafik; KUSBUDIONO, Kusbudiono (CGANT JOURNAL OF MATHEMATICS AND APPLICATION, 2021-06-01)
      Let G = (V, E) be a set of ordered set W = {W1, W2, W3, ..., Wk} from the set of vertices in connected graph G. The metric dimension is the minimum cardinality of the resolving set on G. The representation of v on W is ...

    • Modul Aplikasi Graf dalam Bioteknologi 

      KRISTIANA, Arika Indah; DAFIK, Dafik; ADAWIYAH, Robiatul (Fakultas Keguruan dan Ilmu Pendidikan - UNEJ, 2020-01-09)
      Modul ini disusun untuk membantu mahasiswa Program Studi Pendidkan Matematika Fakultas Keguruan dan Ilmu Pendidikan, Universitas Jember. Teori graf dikenalkan oleh Leonhard Euler, seorang matematikawan Swiss diperkirakan ...

    • On Local Irregularity of the Vertex Coloring of the Corona Product of a Tree Graph 

      KRISTIANA, Arika Indah; HIDAYAT, M.; ADAWIYAH, Robiatul; DAFIK, Dafik; SETIAWANI, Susi; ALFARISI, Ridho (Jurnal Bioindustri, 2022)
      Let G = (V, E) be a graph with a vertex set V and an edge set E. The graph G is said to be with a local irregular vertex coloring if there is a function f called a local irregularity vertex coloring with the properties: ...

    • On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs 

      KRISTIANA, Arika Indah; DAFIK, Dafik; UTOYO, Muhammad Imam; AGUSTIN, Ika Hesti (International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017], 2017-04-09)
      This study is a natural extension of k -proper coloring of any simple and connected graph G. By a n rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the neighbors of any vert ...

    • On r-dynamic vertex coloring of some flower graph families 

      GOMATHI, C.S.; MOHANAPRIYA, N.; KRISTIANA, Arika Indah; DAFIK, Dafik (World Scientific Publishing Company, 2021-03-03)
      e a simple, connected undirected graph with m vertices and n edges. Let ver tex coloring c of a graph G be a mapping c : V (G) → S, where |S| = k and it is k-colorable. Vertex coloring is proper if none of the any two ...

    • On strengthening the local politics to the realization of rural quality education sustainable development goals 

      W RASAILI, W Rasaili; DAFIK, Dafik; HIDAYAT, Rahmad; PRAYITNO, Hadi (IOP Conf. Series: Earth and Environmental Science, 2022-12-20)
      The Sustanaible development goals (SDGS) has been popular since 2015. SDG has abig agenda to elevate human dignity. SDGS has 17 strategic agendas where one of them isquality education. The quality education agenda must ...

    • On super (a, d) − P2 B H− antimagic total labeling of disjoint union of comb product graphs 

      PRIHANDINI, R M; DAFIK, Dafik; AGUSTIN, I H Agustin; ALFARISI, R Alfarisi; ADAWIYAH, R Adawiyah; Santoso, K A Santoso (antimagic total labeling of disjoint union of comb product graphs, 2019-05-07)
      This study focuses on simple and undirected graphs. For a graph G = (V, E), a bijection λ from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called super (a, d)-H-antimagic total labeling of G if the total P2BH−weights, ...

    • On the Chromatic Number Local Irregularity of Related Wheel Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; AGUSTIN, Ika Hesti; ALFARISI, Ridho; WALUYO, Eko (IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012003, 2019-05-07)
      A function f is called a local irregularity vertex coloring if (i) l : V (G) ! f1; 2; ; kg as vertex irregular k-labeling and w : V (G) ! N, for every uv 2 E(G); w(u) 6= w(v) where w(u) = v2N(u)l(v) and (ii) ...

    • On the Local Irregularity Vertex Coloring of Related Grid Graph 

      AZAHRA, Nadia; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 2, February – 2020, Pages: 1-4, 2020-02-01)
      All graph in this paper is connected and simple graph. Let graph d(u,v) be a distance between any vertex u and v in graph ( ). A functio ( ) * +n is called vertex irregular k-labelling and ( ) where ...

    • On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs 

      KRISTIANA, Arika Indah; NIKMAH, Nafidatun; DAFIK, Dafik; ALFARISI, Ridho; HASAN, M. Ali; SLAMIN, Slamin (World Scientific Publishing Company, 2021-09-05)
      Let G = (V,E) be a simple, finite, undirected, and connected graph with vertex set V (G) and edge set E(G). A bijection l : V (G) → {1, 2,...,k} is label function l if opt(l) = min{max(li) : li vertex irregular labeling} ...