Now showing items 41-60 of 69

    • On the Local Multiset Dimension of Graph With Homogenous Pendant Edges 

      ADAWIYAH, Robiatul; DAFIK, Dafik; AGUSTIN, Ika Hesti; PRIHANDINI, Rafiantika Megahnia; ALFARISI, Ridho; ALBIRRI, Ermita Rizki (Journal of Physics: Conference Series, 2019-12-01)
      Let G be a connected graph with E as edge set and V as vertex set . rm(v|W) = {d(v, s1), d(v, s2), . . . , d(v, sk)} is the multiset representation of a vertex v of G with respect to W where d(v, si) is a distance between ...
    • 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 Metric-Location-Domination Number of Some Exponential Graphs 

      FIKRI, Fauzul; SLAMIN, Slamin; DAFIK, Dafik; KUSBUDIONO, Kusbudiono (The International Journal of Health, Education and Social (IJHES), 2019-11-30)
      On the Metric-Location-Domination Number of Some Exponential Graphs
    • On The Packing k-Coloring of Edge Corona Product 

      JOEDO, Jean Claudia; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59, 2019-12-01)
      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 c :VG1, 2,, k is called a packing k-coloring if every two vertices ...
    • On The Packing k-Coloring of Unicyclic Graph Family 

      ARININGTYAS, Regina; KRISTIANA, Arika Indah; DAFIK, Dafik (International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9, 2020-01-09)
      All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k  coloring if every two vertex of color i are ...
    • On the r-Dynamic Chromatic Number of the Corronation by Complete Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik (IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 2018-04-27)
      In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least minfr; d(v)g di®erent colors. The ...
    • On the r-Dynamic Chromatic Numberof Corona Product of Star Graph 

      KRISTIANA, Arika Indah; UTOYO, Mohammad Imam; DAFIK, Dafik; ALFARISI, Ridho; WALUYO, Eko (Thai Journal of Mathematics, 2022-10-01)
      A proper k coloring of graph G such that the neighbors of any vertex v ∈ V (G) where at least min{r, d(v)} different colors is defined an r-dynamic coloring. The minimum k such that graph G has an r-dynamic k coloring is ...
    • On The Rainbow Antimagic Connection Number of Some Wheel Related Graphs 

      KUSUMAWARDANI, Intan; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol.3 Issue 12, December – 2019, Pages: 60-64, 2019-12-01)
      All graphs in this paper is connected and simple. Let ( ) be a connected and simple graph with vertices set and edge set . A bijection function * | ( )|+ is called an edge antimagic vertex ...
    • 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 ...
    • Pengembangan Media Pembelajaran Berbantuan Software Lectora Inspire Pada Materi Permutasi Dan Kombinasi 

      RIZALDY, Reza; HOBRI, Hobri; DAFIK, Dafik; FATAHILLAH, Arif; YUDIANTO, Erfan (Seminar Nasional Pendidikan Matematika dan Matematika, 2019-01-01)
      —Kecanggihan teknologi dan informasi perlu dikembangkan dalam pendidikan. Pemanfaatan perkembangan teknologi diharapkan mampu mendorong kemajuan ilmu pengetahuan dalam dunia pendidikan, termasuk matematika. Lectora inspire ...
    • Pengembangan Perangkat Pembelajaran Matematika Berbasis Karakter dengan Cooperative Learning Tipe Student Team Achievement Divisions (STAD) Sub Pokok Bahasan Logika Matematika Kelas X Rekayasa Perangkat Lunak (RPL) 

      GREFINA, Shela Okta; SUSANTO, Susanto; DAFIK, Dafik (Pancaran, Vol. 4, No. 2, hal 135-142, Mei 2015, 2015-05-01)
      The research purpose is to know the process and result of the development of mathematics learning materials based on character by cooperative learning of student teams achievement divisions (stad) type for logic mathematics ...
    • Pewarnaan Sisi Ketakteraturan Lokal Refleksif pada Keluarga Graf Planar 

      MUTTAQI, Nuwaila Izzatul; ADAWIYAH, Robiatul; DAFIK, Dafik (Journal of Mathematics and Applications, 2022)
      Let a simple and connected graph G = (V, E) with the vertex set V (G) and the edge set E(G). If there is a mapping f: V (G) → 0, 2, . . . , 2kv and f: E(G) → 1, 2, . . . , ke as a function of vertex and edge irregularities ...
    • Pewarnaan Sisi r-Dinamis pada Graf Khusus dan Graf Operasi Sakel 

      NOVIYANTI, Viqedina Rizky; KUSBUDIONO, Kusbudiono; HESTI A, Ika; DAFIK, Dafik (CGANT Journal of Mathematics and Applications, 2021-06-01)
      Let G = (V (G), E(G)) be a nontrivial connected graph. The edge coloring is defined as c : E(G) → {1, 2, ..., k}, k ∈ N, with the condition that no adjacent edges have the same color. k-color r-dynamic is an edge coloring ...
    • Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Tangga 

      AKBAR, Rizki Aulia; DAFIK, Dafik; PRIHANDINI, Rafiantika Megahnia (CGANT Journal of Mathematics and Applications, 2022)
      Let a simple and connected graph G = (V, E) with the vertex set V (G) and the edge set E(G). If there is a mapping f: V (G) → 0, 2, . . . , 2kv and f: E(G) → 1, 2, . . . , ke as a function of vertex and edge irregularities ...
    • r-Dynamic Coloring of the Corona Product of Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; ALFARISI, Ridho; DAFIK, Dafik (Discrete Mathematics, Algorithms and Applications Vol. 12, No. 2 (2020) 2050019, 2020-01-21)
      Let G = (V, E) be a graph. A proper k-coloring of graph G is r-dynamic coloring if for every v, the neighbors of vertex v receive at least min { r, d(v) } different colors. The minimum k such that graph G has r-dynamic ...
    • The r-Dynamic Local Irregularity Vertex Coloring of Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; ALFARISI, Ridho; WALUYO, Eko (INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019, 2019-07-01)
      We define the r-dynamic local irregularity vertex coloring. Suppose  : V(G)  {1,2, … , k} is called vertex irregular k-labeling and w : V(G)  N where 𝑤(𝑢) = ∑ (𝑣) .  is called r-dynamic local irregular vertex ...
    • Report and Recommendation of Implementation Research-Based Learning in Improving Combinatorial Thinking Skills Embedded in Stem Parachute Design Activities Assisted by Ccr (Cloud Classroom) 

      RIDLO, Zainur Rasyid; DAFIK, Dafik; C I W NUGROHO, C I W Nugroho (Universal Journal of Educational Research, 2020-03-01)
      The research aims to compare the advanced class (experimental class) and traditional class with the traditional teaching method. This research is concerned with STEM activity in parachute design. The experiment class ...
    • Research Based Learning and STEM Learning Activities: The Use of R-Dynamic Coloring to Improve the Students Meta-literacy in Solving a Tessellation Decoration Problem 

      KRISTIANA, Arika Indah; RIDLO, Zainur Rasyid; PRIHANDINI, Rafiantika Megahnia; DAFIK, Dafik; ADAWIYAH, Robiatul (European Journal of Education and Pedagogy, 2022-08-02)
      The meta-literacy ability is very important in today's life, especially living in the disruptive technology era. Meta-literacy is an ability that goes beyond metacognition and technological literacy. However, the students’ ...
    • The Research-based Learning-STEM Learning Activity Framework: The use of Software J-Batik in Designing the Indonesian Batik Motifs as Traditional Cultural Heritage to Improve Students Historical Literacy 

      SUMARDI, Sumardi; RIDLO, Zainur Rasyid; PUJI, Rully Putri Nirmala; DAFIK, Dafik (International Academic Journal of Education & Literature, 2022-08-30)
      Objective: This research was intended to develop the RBL (researchbased learning) model of teaching activities framework integrated with the STEM approach, namely designing the Indonesian Batik motifs as Traditional Cultural ...