Now showing items 61-69 of 69

    • Resolving Domination Number of Graphs 

      ALFARISI, Ridho; DAFIK, Dafik; KRISTIANA, Arika Indah (Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071, 2019-11-05)
      For a set W = { s1,s2,...,sk of vertices of a graph G, the representation multiset of a vertexv of G with respect to W is r(v | W ) = { d(v, s1),d(v, s2),...,d(v, sk) } , where d(v, si) is a distance between of ...
    • Resolving Domination Numbers of Family of Tree Graph 

      MARDIYA, Regita Triani; KRISTIANA, Arika Indah; DAFIK, Dafik (International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 27-30, 2020-01-09)
      All graph in this paper are members of family of graph tree. Let G is a connected graph, for an ordered set W={w1,w2,...,wk} of vertices and a vertex which is not element of W, then W is dominating set of graph G when the ...
    • Some Families of Tree Are Elegant 

      PRIHANDINI, Rafiantika Megahnia; ADAWIYAH, Robiatul; KRISTIANA, Arika Indah; DAFIK, Dafik; FATAHILLAH, Arif; ALBIRRI, Ermita Rizki (Advances in Mathematics: Scientific Journal 9, 2020-12-04)
      An elegant labeling on the graph G with n vertex and m edge is a one-to-one mapping (injection function) of the vertex set V (G) to the set of non negative integers {0, 1, 2, 3, . . . , m} such that each edge gets the ...
    • Stream-keys generation based on graph labeling for strengthening Vigenere encryption 

      PRIHANDOKO, Antonius Cahya; DAFIK, Dafik; AGUSTIN, Ika Hesti (International Journal of Electrical and Computer Engineering (IJECE), 2022-08-01)
      This paper address the cryptographic keys management problem: how to generate the cryptographic keys and apply them to secure encryption. The purpose of this research was to study on utilizing graph labeling for generating ...
    • Student Critical thinking in Solving Two Dimensional Armetics Problems Based on 21th Century Skills 

      MUKHLIS, Mohammad; DAFIK, Dafik; HOBRI, Hobri (International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-5, Issue-4, Apr- 2018], 2018-04-01)
      Critical thinking has a very important role in constructing the improvement of students' ability to face the 21st century, especially in generalizing the pattern of the two dimensional arithmetic series. Since critical ...
    • Students Creative Thinking Skills in Solving Two Dimensional Arithmetic Series through Research-Based Learning 

      TOHIR, Muhammad; ABIDIN, Zainal; DAFIK, Dafik; HOBRI, Hobri (IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012072, 2017-11-17)
      Arithmetics is one of the topics in Mathematics, which deals with logic and detailed process upon generalizing formula. Creativity and flexibility are needed in generalizing formula of arithmetics series. This research ...
    • Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph 

      SUMARNO, Djoni Budi; DAFIK, Dafik; SANTOSO, Kiswara Angung (Jurnal Ilmu Dasar, 2014-07-01)
      Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic total if there exist a bijection f : V (G) ∪ E(G) → {1, 2,...,p + q} such that the edge-weights, w(uv) = f(u)+f(v)+f(uv); u, v ∈ V ...
    • Vertex Coloring Edge-Weighting of Coronation by Path Graphs 

      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) 012004, 2019-05-07)
      In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of graph G is mapping w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring Fw : V (G) ! N de ned by fw(v) = P v2e w(e). ...
    • 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 ...