Search
Now showing items 1-10 of 18
Sistem Perencanaan Dan Peramalan Distribusi Produk Berdasarkan Jumlah Permintaan Menggunakan Metode Weight Moving Average
(2017-10-16)
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 LABELLING OF GRAPHS
(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 METRIC DIMENSION OF EDGE-CORONA GRAPHS
(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 distance-irregular labelings of cycles and wheels
(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
(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 ...
A survey of face-antimagic evaluations of graphs
(2017-12-04)
The concept of face-antimagic labeling of plane graphs was introduced by
Mirka Miller in 2003. This survey aims to give an overview of the recent
results obtained in this topic.
Domination Number of Vertex Amalgamation of Graphs
(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. ...
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
(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 ...
THE SIMILARITY OF METRIC DIMENSION AND LOCAL METRIC DIMENSION OF ROOTED PRODUCT GRAPH
(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 ...
TOTAL VERTEX IRREGULARITY STRENGTH OF LADDER RELATED GRAPHS
(2017-09-11)
We investigate modifications of the well-known irregularity strength of graphs, namely the
total vertex irregularity strength. In this paper, we determine the exact value of the total vertex irregularity
strength of ...