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

Abstract

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.

Author Biographies

PANDE GDE DONY GUMILAR, Faculty of Mathematics and Natural Sciences, Udayana University
Jurusan Matematika, FMIPA Universitas Udayana
LUH PUTU IDA HARINI, Faculty of Mathematics and Natural Sciences, Udayana University
Jurusan Matematika, FMIPA Universitas Udayana
KARTIKA SARI, Faculty of Mathematics and Natural Sciences, Udayana University
Jurusan Matematika, FMIPA Universitas Udayana
Published
2013-05-31
How to Cite
DONY GUMILAR, PANDE GDE; IDA HARINI, LUH PUTU; SARI, KARTIKA. DIMENSI METRIK GRAPH LOBSTER Ln (q;r). E-Jurnal Matematika, [S.l.], v. 2, n. 2, p. 42-48, may 2013. ISSN 2303-1751. Available at: <https://ojs.unud.ac.id/index.php/mtk/article/view/6308>. Date accessed: 21 nov. 2019. doi: https://doi.org/10.24843/MTK.2013.v02.i02.p037.
Section
Articles

Keywords

lobster graph; metric dimension; resolving set