Browsing LSP-Jurnal Ilmiah Dosen by Author "AGUSTIN, Ika Hesti"

Now showing items 1-15 of 15

    • Analisa Antimagicness Super dari Shackle Graf Parasut dan Aplikasinya pada Polyalphabetic Cipher 

      NURFADILA, Riza; AGUSTIN, Ika Hesti; KUSBUDIONO, Kusbudiono (CGANT Journal of Mathematics and Applications, 2021-06-22)
      Super (a,d)-H-antimagic total covering on a graph G=(V,E) is the total labeling of λ of V(G) ∪ E(G) with positive integers {1, 2, 3,. . . ,|V (G)∪E(G)|}, for any subgraph H’ of G that is isomorphic to H where P H’ = P v∈V ...

    • Analisis rainbow vertex connection pada beberapa graf khusus dan operasinya 

      ARISKA, Ida; AGUSTIN, Ika Hesti; KUSBUDIONO, Kusbudiono (JCGANT Journal of Mathematics and Applications, 2022-06-01)
      The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), ...

    • Elegant Labeling Of Some Graphs 

      PRIHANDINI, Rafiantika Megahnia; DAFIK, Dafik; ADAWIYAH, Robiatul; ALFARISI, Ridho; AGUSTIN, Ika Hesti; M VENKATACHALAM, M Venkatachalam (Journal of Physics: Conference Series, 2020-12-01)
      In this paper, we introduce a new notion of graph theory study, namely a local edge metric dimension. It is a natural extension of metric dimension concept. dG(e, v) = min{d(x, v), d(y, v)} is the distance between the ...

    • Elegant Labeling of Some Graphs 

      PRIHANDINI, Rafiantika Megahnia; DAFIK, Dafik; AGUSTIN, Ika Hesti; ALFARISI, Ridho; ADAWIYAH, Robiatul (Journal of Physics: Conference Series, 2020-06-19)
      An elegant labeling on graph G with vertices and edges is an injective (one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers f0; 1; 2; 3; :::; g in such a way that the set of values ...

    • 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 Irregularity Vertex Coloring of Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; SLAMIN, Slamin; ALFARISI, Ridho; AGUSTIN, Ika Hesti; M. Venkatachalam (nternational Journal of Civil Engineering and Technology (IJCIET) Volume 10, Issue 03, March 2019, pp. 1606–1616, 2019-03-03)
      In this paper we study a new notion of coloring type of graph, namely a local irregularity vertex coloring. We define is called vertex irregular -labeling and where . By a ...

    • Modification of Chaos Game with Rotational Variation on a Square 

      PURNOMO, Kosala Dwidja; LARASATI, Indy; AGUSTIN, Ika Hesti; UBAIDILLAH, Firdaus (CAUCHY –Jurnal Matematika Murni dan Aplikasi Volume 6(1) (2019), Pages 27-33, 2019-12-01)
      Chaos game is a game of drawing a number of points in a geometric shape using certain rules that are repeated iteratively. Using those rules, a number of points generated and form some pattern. The original chaos game ...

    • On H-Supermagic Labelings of m-Shadow of Paths and Cycles 

      AGUSTIN, Ika Hesti; SUSANTO, Faisal; DAFIK; PRIHANDINI, Rafiantika Megahnia; ALFARISI, Ridho; I. W. Sudarsana (2019-03-04)
      The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (a,d)-H-antimagic.

    • 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 super H-Antimagicness of an Edge Comb Product of Graphs with Subgraph as a Terminal of its Amalgamation 

      DAFIK; AGUSTIN, Ika Hesti; NURVITANINGRUM, A.I; Prihandini, Rafiantika Megahnia (2018-02-28)
      All graphs in this paper are simple, nite, and undirected graph. Let r be a edges of H. The edge comb product between L and H, denoted by LB H, is a graph obtained by taking one copy of L and jE(L)j copies of H and ...

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

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

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