Browsing LSPJurnal Ilmiah Dosen by Title
Now showing items 13041323 of 2333

On (local) metric dimension of graphs with mpendant points
(20170911)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
(20171130)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 distanceirregular labelings of cycles and wheels
(20171204)Distanceirregular labeling was introduced by Slamin, and in his paper he determined the distanceirregular 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 EDGECORONA GRAPHS
(20171130)This paper discusses some characterization and exact values for metric dimension of edgecorona from a connected graph not tree G with an arbitrary nontrivial graph H. 
On rDynamic Chromatic Number of the Corronation of Path and Several Graphs
(International Journal of Advanced Engineering Research and Science (IJAERS), [Vol4, Issue4, Apr 2017], 20170409)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 rdynamic coloring of some graph operations
(20180307)Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an rdynamic kcoloring of graph G, we mean a proper kcoloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ... 
On Rainbow kConnection Number of Special Graphs and It's Sharp Lower Bound
(20180228)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
(20190725)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
(20170911)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
(IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012003, 20190507)A function f is called a local irregularity vertex coloring if (i) l : V (G) ! f1; 2; ; kg as vertex irregular klabeling 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 HenstockKurzweil Integral of C [a; b] Spacevalued Functions
(International Journal of Mathematical Analysis Vol. 9, 2015, no. 37, 1831  1846, 20150901)Let C[a; b] be the set of all realvalued continuous functions de ned on a closed interval [a; b] R. In this paper, we construct the HenstockKurzweil integral on a closed interval [f; g] C[a; b] and investigate some ... 
On The LDS of the Joint Product of Graphs
(20190902)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
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 2, February – 2020, Pages: 14, 20200201)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 klabelling and ( ) where ... 
On The Local Metric Dimension of Line Graph of Special Graph
(20180228)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 kColoring of Edge Corona Product
(International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 5559, 20191201)All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G V,E . A function c :VG1, 2,, k is called a packing kcoloring if every two vertices ... 
On The Packing kColoring of Unicyclic Graph Family
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 19, 20200109)All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k coloring if every two vertex of color i are ... 
On the rDynamic Chromatic Number of the Corronation by Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 20180427)In this paper we will study the rdynamic chromatic number of the coronation by complete graph. A proper kcoloring 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
(International Journal of Academic and Applied Research (IJAAR), Vol.3 Issue 12, December – 2019, Pages: 6064, 20191201)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 Hirregularity strength of graphs: A new notion
(20180228)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
(20190104)Coffee is a kind of beverage that is widespread and muchloved 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 ...