Browsing LSP-Conference Proceeding by Author "Agustin, Ika Hesti"

Now showing items 1-4 of 4

    • The Antimagicness of Super (a, d) - P2⊵̇H Total Covering on Total Comb Graphs 

      Prihandini, Rafiantika Megahnia; Dafik, Dafik; Slamin, Slamin; Agustin, Ika Hesti (2018-10-29)
      A graph can be constructed in several ways. One of them is by operating two or more graphs. The resulting graphs will be a new graph which has certain characteristics. One of the latest graph operations is total comb of ...

    • Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges 

      Alfarisi, Ridho; Dafik, Dafik; Kristiana, Arika Indah; Albirri, Ermita Rizki; Agustin, Ika Hesti (2018-10-29)
      A set is called a resolving set of if every vertices of have diff erent r epr esentation. The minimum cardinalit y of resolving set is metric dimension, denoted by . Furthermore, the resolving set of is called ...

    • On Super Local Antimagic Total Edge Coloring of Some Wheel Related Graphs 

      Agustin, Ika Hesti; Alfarisi, Ridho; Dafik, Dafik; Kristiana, Arika Indah; Prihandini, Rafiantika Megahnia; Kurniawati, Elsa Yuli (2018-10-29)
      Let G be a connected graph, let V(G) be the vertex set of graph G, and let E(G) be the edge set of graph G. Thus, the bijective function f : V(G) ∪ E(G) −→ {1, 2, 3, ..., |V(G)| + |E(G)|} is called a local antimagic ...

    • On the rainbow coloring for some graph operations 

      Dafik, Dafik; Agustin, Ika Hesti; Fajariyato, Anang; Alfarisi, Ridho (2018-02-28)
      Let G = (V, E) be a nontrivial, finite, simple and undirected connected graph on which is defined a coloring f : E(G) → {1,2, …, k}, k ∈ N. The adjacent edges may be colored the same colors. A path in an edge colored graph ...