Now showing items 1-10 of 13
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
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 ...
On the ascending subgraph decomposition problem for bipartite graphs
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 DISTANCE IRREGULAR LABELLING OF GRAPHS
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 METRIC DIMENSION OF EDGE-CORONA GRAPHS
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.
Labeling of Chordal Rings
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 ...
The non-isolated resolving number of k-corona product of graphs
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, ...
Sistem Perencanaan Dan Peramalan Distribusi Produk Berdasarkan Jumlah Permintaan Menggunakan Metode Weight Moving Average
Purnama Jati is one of the home industries in Jember Regency which is specialized in Jember specialities food. One of the excellent products produced by Purnama Jati is “proll tape”. To market its products, Purnama Jati ...
On distance-irregular labelings of cycles and wheels
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 ...
Domination Number of Vertex Amalgamation of Graphs
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. ...
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
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 ...