Browsing LSP-Jurnal Ilmiah Dosen by Author "Slamin, Slamin"
Now showing items 1-20 of 23
-
Application of Linear Programming for Expatriate Assignment Planning
Utami, Wiji; Tobing, Diana Sulianti K.; Paramu, Hadi; Slamin, Slamin (IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012038, 2019-05-07)An expatriate is a person who lives temporarily or resides outside her/his native country or a foreign who lives in a country. It is usually because of a state or professional duty. The activity of sending employees to ... -
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
Gembong A.W; Slamin, Slamin; Dafik, Dafik; Agustin, Ika Hesti (2017-09-11)Let G =(V, E) be a simple, nontrivial, finite, 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 ... -
Domination Number of Vertex Amalgamation of Graphs
Y. Wahyuni; M. I. Utoyo; Slamin, Slamin (2017-09-11)For a graph G = (V, E), a subset S of V is called a dominating set if every vertex x in V is either in S or adjacent to a vertex in S. The domination number 𝜸(𝑮) is the minimum cardinality of the dominating set of G. ... -
Expatriate Career Development: Self Efficacy, Multicultural Personality, Collective Efficacy, and Individual ExpatriatePperformance
Utami, Wiji; Tobing, Diana Sulianti K.; Paramu, Hadi; Slamin, Slamin (Int. J. Trade and Global Markets, Vol. 12, No. 2, 2019, 2019-04-01)This research aims to identify and analyse the factors that are affecting the performance of expatriates. The population in this study were expatriates who worked in Indonesia. The sampling method was snowball sampling. ... -
Hybrid Profile Matching and Forest Fire Model Strategies in Serious Game Supply Chain Management Agribusiness
Bukhori, Saiful; Utami, Wiji; Slamin, Slamin (2017-08-01)Supply Chain Management (SCM) is increasingly being recognized as the integration of key business processes across the supply chain. Any company that joined in SCM must consider the strategies of the firm’s competitors. ... -
Labeling of Chordal Rings
Javaid, Imran; Ismail, Abida; Salman, Muhammad; Ahmad, Ali; Slamin, Slamin (2017-09-11)The chordal ring of order n, denoted by CRn(x, y, z), is the graph with vertex set Zn, an additive group of integers modulo n, and adjacencies given by i '"i+ x, i '"i + y, i '"i + z for all even vertex i and distinct odd ... -
The non-isolated resolving number of k-corona product of graphs
Alfarisi, Ridho; Dafik, Dafik; Slamin, Slamin; Agustin, Ika Hesti; Kristiana, Arika Indah (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, ... -
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 COMMUTATIVE CHARACTERIZATION OF GENERALIZED COMB AND CORONA PRODUCTS OF GRAPHS WITH RESPECT TO THE LOCAL METRIC DIMENSION
L. Susilowati; M. I. Utoyo; Slamin, Slamin (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 =| ... -
On Commutative Characterization of Graph Operation with Respect to Metric Dimension
Susilowati, Liliek; Utoyo, Mohammad Imam; Slamin, Slamin (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 ... -
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 Local Adjacency Metric Dimension of Some Wheel Related Graphs with Pendant Points
Rinurwati, Rinurwati; Suprajitno, Herry; Slamin, Slamin (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 ... -
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 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 local edge antimagicness of m-splitting graphs
Albirri, Ermita Rizki; Dafik, Dafik; Slamin, Slamin; Agustin, Ika Hesti; Alfarisi, Ridho (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, ... -
On the total rainbow connection of the wheel related graphs
M.S Hasan; Slamin, Slamin; Dafik, Dafik; Agustin, Ika Hesti; Alfarisi, Ridho (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 ... -
Plants Watering Schedule Algorithm Using the Edge Coloring Graph Technique
Adiwijaya, Nelly Oktavia; Slamin, Slamin (2017-06-07)Scheduling problem can be solved with graph methods. It is required an effective and efficient way to solve this problem in order to obtain optimum results subject to the given constraints. This study aims to solve the ... -
Rancang Bangun Aplikasi Customer Relationship Management (CRM) Untuk Identifikasi Tingkat Kepuasan Pelanggan Pada Perusahaan PT. TIKI Jalur Nugraha Ekakurir (JNE) Agen Mastrip Jember Menggunakan Metode K-Means Clustering
Maulana, Mochammad Bustommy; Slamin, Slamin; Juwita, Oktalia (2017-12-07)The level of customer satisfaction is a benchmark to get a better benefit. One of the strategies that relates to creation of customer satisfaction is customer relationship management (CRM). Tiki Jalur Nugraha Ekakurir ... -
THE SIMILARITY OF METRIC DIMENSION AND LOCAL METRIC DIMENSION OF ROOTED PRODUCT GRAPH
L. Susilowati; Slamin, Slamin; M. I. Utoyo; N. Estuningsih (2017-09-11)Let G be a connected graph with vertex set ( )GV and =W {}()....,,, ⊂ The representation of a vertex ( )GVv ∈ with respect to W is the ordered k-tuple ( ) ( ) ( )( ...,,,,, GVwww 21 ()),, k k 1 wvdwvdWvr ...