Browsing LSP-Conference Proceeding by Author "DAFIK, Dafik"

Now showing items 1-6 of 6

    • 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 ...

    • 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 ...

    • On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph 

      YUNIKA, S.M.; SLAMIN, Slamin; DAFIK, Dafik; KUSBUDIONO, Kusbudiono (Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
      Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and ...

    • On the Rainbow Vertex Connection Number of Edge Comb of Some Graph 

      M, Agustina; DAFIK, Dafik; SLAMIN, Slamin; KUSBUDIONO, Kusbudiono (Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
      By an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H), E(G D H)) ...

    • On Total r-Dynamic Coloring of Several Classes of Graphs and Their Related Operations 

      KUSBUDIONO, Kusbudiono; PUTRI, Desi Febriani; DAFIK, Dafik; KRISTIANA, Arika Indah (roceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
      All graphs in this paper are simple, connected and undirected. Let r, k be natural numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive ...

    • Vertex colouring using the adjacency matrix 

      SANTOSO, K A Santoso; DAFIK, Dafik; AGUSTIN, I H Agustin; PRIHANDINI, R M Prihandini; ALFARISI, R Alfarisi (ICCGANT, 2018-11-24)
      Recently, graph theory is one of the most rapidly developing sciences. Graphs in its applications are generally used to represent discrete objects and relationships between these objects. The visual representation of a ...