Now showing items 1144-1163 of 2070

    • On (local) metric dimension of graphs with m-pendant points 

      Rinurwati; Slamin, Slamin; H. Suprajitno (2017-09-11)
      An ordered set of vertices S is called as a (local) resolving set of a connected graph ),( EVG if for any two adjacent vertices GG Content from this work may be used under the terms of the Creative Commons Attribution ...
    • ON DISTANCE IRREGULAR LABELLING OF GRAPHS 

      Slamin, Slamin (2017-11-30)
      Motivated by definition of distance magic labelling, we introduce a new type of irregular labelling whose evaluation is based on the neighbourhood of a vertex. We define a distance irregular labelling on a ...
    • On distance-irregular labelings of cycles and wheels 

      Novi H. Bong; Yuqing Lin; Slamin, Slamin (2017-12-04)
      Distance-irregular labeling was introduced by Slamin, and in his paper he determined the distance-irregular labeling for cycles and wheels of length f0; 1; 2; 5g mod 8. In this paper, we complete his results for cycles and ...
    • ON METRIC DIMENSION OF EDGE-CORONA GRAPHS 

      Rinurwati, Rinurwati; Suprajitno, Herry; Slamin, Slamin (2017-11-30)
      This paper discusses some characterization and exact values for metric dimension of edge-corona from a connected graph not tree G with an arbitrary nontrivial graph H.
    • 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 r-dynamic coloring of some graph operations 

      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 ...
    • On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound 

      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 ...
    • On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique 

      Agustin, Ika Hesti; Dafik, Dafik; Marsidi, Marsidi; Alfarisi, Ridho; Kurniawati, Elsa Yuli (2019-07-25)
      In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E. By a edge local antimagic total labeling, we mean a bijection f:V(G)∪E(G)→{1,2,3,...,|V(G)|+|E(G)|} ...
    • On the ascending subgraph decomposition problem for bipartite graphs 

      J. M. Aroca; A. Llado; Slamin, Slamin (2017-09-11)
      The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with n+1 2 edges admits an edge decomposition G = H has i edges and is isomorphic to a subgraph of H i+1 1 ⊕· · · ⊕H , i = 1, ...
    • 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 LDS of the Joint Product of Graphs 

      Agustin, Ika Hesti; Dafik, Dafik; Kusbudiono, Kusbudiono; Rachman, Shinta Aditya; Wardani, Dwi Agustin Retno (2019-09-02)
      Locating dominating set (LDS) is one of the topics of graph theory. A set VD of vertices in graph G is called a dominating set if every vertex V u is either an element of D or adjacent to some element ...
    • On the Local Irregularity Vertex Coloring of Related Grid Graph 

      AZAHRA, Nadia; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 2, February – 2020, Pages: 1-4, 2020-02-01)
      All graph in this paper is connected and simple graph. Let graph d(u,v) be a distance between any vertex u and v in graph ( ). A functio ( ) * +n is called vertex irregular k-labelling and ( ) where ...
    • On The Local Metric Dimension of Line Graph of Special Graph 

      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 ...
    • On The Packing k-Coloring of Edge Corona Product 

      JOEDO, Jean Claudia; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59, 2019-12-01)
      All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G  V,E . A function c :VG1, 2,, k is called a packing k-coloring if every two vertices ...
    • On The Packing k-Coloring of Unicyclic Graph Family 

      ARININGTYAS, Regina; KRISTIANA, Arika Indah; DAFIK, Dafik (International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9, 2020-01-09)
      All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k  coloring if every two vertex of color i are ...
    • On the r-Dynamic Chromatic Number of the Corronation by Complete Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik (IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 2018-04-27)
      In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least minfr; d(v)g di®erent colors. The ...
    • On The Rainbow Antimagic Connection Number of Some Wheel Related Graphs 

      KUSUMAWARDANI, Intan; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol.3 Issue 12, December – 2019, Pages: 60-64, 2019-12-01)
      All graphs in this paper is connected and simple. Let ( ) be a connected and simple graph with vertices set and edge set . A bijection function * | ( )|+ is called an edge antimagic vertex ...
    • On the total H-irregularity strength of graphs: A new notion 

      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 , ...
    • The Online Marketing Strategic Planning for Jember Coffee SMEs 

      Juwita, Oktalia; Arifin, Fajrin Nurman; Dewi, Fitriyana (2019-01-04)
      Coffee is a kind of beverage that is widespread and much-loved in the world. Today coffee has become a lifestyle. Various kinds of coffee are offering in many shops. This is a great opportunity for entrepreneurs, especially ...
    • Online Statistical Modeling (Regression Analysis) for Independent Responses 

      Tirta, I Made; Anggraeni, Dian; Pandutama, Martinus (2018-02-07)
      Regression analysis (statistical analmodelling) are among statistical methods which are frequently needed in analyzing quantitative data, especially to model relationship between response and explanatory variables. ...