Now showing items 21-26 of 26

    • Several classes of graphs and their r-dynamic chromatic numbers 

      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. ...
    • A study of local domination number of Sn H graph 

      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 ...
    • Super (a*, d*)-H-antimagic total covering of second order of shackle graphs 

      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 ¸ ...
    • Super (a, d)-Cycles-Antimagic Labeling of Subdivision of a Fan Graph 

      Prihandini, Rafiantika Megahnia; Alfarisi, Ridho; Agustin, Ika Hesti; Dafik, Dafik (2018-12-21)
      We consider a simple, connected and undirected graph ( )EVG , with vertex set ()GV and edge set ( ).GE There is a super ( ) H-, da - antimagic total labeling on the graph ( )EVG , if there exists a ...
    • A Super (A,D)-Bm-Antimagic Total Covering Of Ageneralized Amalgamation Of Fan Graphs 

      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, … ...
    • Super local edge antimagic total coloring of Pn . H 

      Kurniawati, Elsa Yuli; Agustin, Ika Hesti; Dafik, Dafik; Alfarisi, Ridho (2018-07-04)
      In this paper, we consider that all graphs are ¯nite, simple and connected. Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡! f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...