DIMENSI METRIK GRAPH LOBSTER Ln (q;r)

PANDE GDE DONY GUMILAR (Faculty of Mathematics and Natural Sciences, Udayana University)
LUH PUTU IDA HARINI (Faculty of Mathematics and Natural Sciences, Udayana University)
KARTIKA SARI (Faculty of Mathematics and Natural Sciences, Udayana University)

E-Jurnal Matematika
Vol 2 No 2 (2013)

The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r). Lobster graph Ln (q;r) is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1) is 1, the metric dimension of lobster graph L2 (1;1) for n > 2 is 2.