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

DSpace/Manakin Repository

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

Sort by: Order: Results:

  • Gembong A.W; Slamin, Slamin; Dafik, Dafik; Agustin, Ika Hesti (2017-09-11)
    Let G =(V, E) be a simple, nontrivial, finite, connected and undirected graph. For an integer 1  k  diam(G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V ...
  • Dafik, Dafik; Agustin, Ika Hesti; D. Hardiyantik (2018-02-28)
    We assume that all graphs in this paper are finite, undirected and no loop and multiple edges. Given a graph G of order p and size q.LetH ,H be subgraphs of G.ByH -covering, we mean every edge in E(G) belongs to at ...
  • Agustin, Ika Hesti; Hasan, Mohammad; Dafik, Dafik; Alfarisi, Ridho; Prihandini, Rafiantika Megahnia (2018-02-28)
    All graphs considered in this paper are finite, simple and connected graphs. Let G(V, E) be a graph with the vertex set V and the edge set E, and let w be the edge weight of graph G. Then a bijection f: V (G) → {1, 2, 3, ...
  • Wardani, Dwi Agustin Retno; Dafik, Dafik; Agustin, Ika Hesti; Kurniawati, Elsa Yuli (2018-02-28)
    An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u 2 V (G) ¡ D is adjacent to some vertex ...
  • Agustin, Ika Hesti; Dafik, Dafik; Gembong A.W (2018-02-28)
    Let G = (V; E) be a simple, nontrivial, nite, connected and undirected graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored graph is said to be a rainbow path if no two edges on the ...
  • Agustin, Ika Hesti; Dafik, Dafik; A.Y. Harsya (2018-03-07)
    Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ...
  • Dafik, Dafik; Agustin, Ika Hesti; A.I Nurvitaningrum; 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 ...
  • Marsidi, Marsidi; Dafik, Dafik; Agustin, Ika Hesti; Alfarisi, Ridho (2018-02-28)
    Let G be a simple, nontrivial, and connected graph. 𝑊 = {𝑤 } is a representation of an ordered set of k distinct vertices in a nontrivial connected graph G. The metric code of a vertex v, where 𝑣 ∈ G, the ordered ...
  • Agustin, Ika Hesti; Dafik, Dafik; Marsidi, Marsidi; Albirri, Ermita Rizki (2018-02-28)
    A total edge irregularity strength of G has been already widely studied in many papers. The total -labeling is said to be a total edge irregular -labeling of the graph G if for every two di erent edges e 1 and e 2 , ...
  • Agustin, Ika Hesti; Prihandini, Rafiantika Megahnia; Dafik, Dafik (2018-04-12)
    Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb product between L and H, denoted by L ▷ H, is a graph obtained by taking one copy of L and |V(L)| copies of H and grafting the ...
  • Dafik, Dafik; D.E.W. Meganingtyas; Purnomo, K. Dwidja; Tarmidzi, M. Dicky; Agustin, Ika Hesti (2018-02-28)
    Let G be a simple, connected and undirected graph. Let r; k be natural numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) ! S, where jSj = k, such that any two adjacent vertices receive di erent colors. ...
  • Dafik, Dafik; Agustin, Ika Hesti; Wardani, Dwi Agustin Retno; Kurniawati, Elsa Yuli (2018-02-28)
    All graphs in this paper are undirected, connected and simple graph. Let G = (V,E) be a graph of order |V| and size |E|. We define a set D as a dominating set if for every vertex μ epsilon V – D is adjacent to some vertex ...
  • Agustin, Ika Hesti; Dafik, Dafik; Latifah, Siti; Prihandini, Rafiantika Megahnia (2018-02-28)
    We assume finite, simple and undirected graphs in this study. Let G, H be two graphs. By an (a,d)-H- antimagic total graph, we mean any obtained bijective function 𝑓 ∶ 𝑉 ( 𝐺 ) ∪ 𝐸 ( 𝐺 ) → {1, 2, 3, … ...
  • Agustin, Ika Hesti; Dafik, Dafik; Nisviasari, Rosanita; Prihandini, Rafiantika Megahnia (2018-02-28)
    Let H be a simple and connected graph. A shackle of graph H, denoted by G = shack(H; v; n), is a graph G constructed by non-trivial graphs H such that, for every 1 · s; t · n, H have no a common vertex with js ¡ tj ¸ ...

Pencarian


Browse

My Account