Bilangan Dominasi Lokasi Metrik pada Graf Kisi
Abstract: For an
ordered set of vertices
and a vertex in
a connected graph , the
representation of v
with respect to is
the ordered –tuple , where represents the distance
between the vertices and . The
set is called a
locating set for if
every vertex of has a distinct representation. A set is a dominating set
of if every vertex in is adjacent to
a vertex of .
A dominating set is
a metric-locatingdominating set,
or an MLD-set, if is both a dominating set and a locating set in . The metric
location domination number of is the minimum cardinality of an MLD-set in . The
purpose of this paper is to find the metric location domination of grid graph.
A grid graph is
defined as a
cartesian product of
two path graphs .
The results are metric location domination number for
each and is and for is . Moreover, we found a conjecture that a metric location
domination for and is .
Penulis: Ratnaning Palupi,
Liliek Susilowati, Nenik Estuningsih & Hazrul Iswadi
Kode Jurnal: jpmatematikadd130072
