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

Sort by: Order: Results:

• (2017-09-11)
Let G =(V, E) be a simple, nontrivial, ﬁnite, 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 ...
• (2018-02-28)
We assume that all graphs in this paper are ﬁnite, 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 ...
• (2018-07-04)
In this paper we use simple and non trivial graph. If there exist a bijective function g : V (G) [ E(G) ! f1; 2; : : : ; jV (G)j + jE(G)jg, such that for all subgraphs P 2 B H of G isomorphic to H, then graph G is ...
• (2018-07-03)
All graph in this paper are ¯nite, simple and connected graph. 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 if for any ...
• (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, ...
• (2018-07-04)
Let all graphs be a connected and simple graph. A set W = fw g of veretx set of G, the kvector ordered r(vjW) = (d(x; w 1 ); d(x; w 2 1 ; w 2 ); : : : ; d(x; w )) of is a representation of v with respect to W, ...
• (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 ...
• (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 ...
• (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 ...
• (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 ...
• (2018-07-03)
Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v 0 in every vertex v such that v 0 adjacent to v in graph G. An m-splitting graph is a graph which has m v 0 -vertices, ...
• (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 ...
• (2018-07-04)
Let G =(V (G),E(G) be a connected graph and v V (G). A dominating set for a graph G =(V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the ...
• (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 , ...
• (2018-07-04)
Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by the same colors. A path P in G is called rainbow ...
• (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 ...
• (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. ...
• (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 ...
• (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, … ...
• (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 ¸ ...