# Browsing LSP-Jurnal Ilmiah Dosen by Title

Sort by: Order: Results:

• (2017-09-11)
Let G be a connected graph with vertex set ( )GV and =W {}( )....,,, GVwww 21 m ⊂ The representation of a vertex ( ),GVv ∈ with respect to W is the ordered m-tuple ( ) ( )( ,, () ( )),,...,,, 2 m wvdWvr =| ...
• (2017-11-30)
Let be a connected graph with vertex set and , ,…, ⊆ . A representation of a vertex ∈) with respect to is an ordered m-tuple | , , , ,..., , where , is the distance between ...
• (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 ...
• (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 ...
• (2019-03-04)
The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (a,d)-H-antimagic.
• (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 ...
• (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. ...
• (2017-12-04)
Let G =(V(G),E(G)) be any connected graph of order n = |V(G)| and measure m = |E(G)|. For an order set of vertices S = { s 1 , s 2 , ..., s k } and a vertex v in G, the adjacency representation of v with respect to ...
• (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 ...
• (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 ...
• (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.
• (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 ...
• (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)|} ...
• (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 ...
• (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, ...
• (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 , ...