DIMENSI METRIK GRAPH LOBSTER Ln (q;r)
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 verte...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Udayana
2013-05-01
|
| Series: | E-Jurnal Matematika |
| Subjects: | |
| Online Access: | https://ojs.unud.ac.id/index.php/mtk/article/view/6308 |
| id |
doaj-42342b4ae1f2448989fd362c1ca87cba |
|---|---|
| record_format |
Article |
| spelling |
doaj-42342b4ae1f2448989fd362c1ca87cba2020-11-24T23:16:38ZengUniversitas UdayanaE-Jurnal Matematika2303-17512013-05-0122424810.24843/MTK.2013.v02.i02.p0376308DIMENSI METRIK GRAPH LOBSTER Ln (q;r)PANDE GDE DONY GUMILAR0LUH PUTU IDA HARINI1KARTIKA SARI2Faculty of Mathematics and Natural Sciences, Udayana UniversityFaculty of Mathematics and Natural Sciences, Udayana UniversityFaculty of Mathematics and Natural Sciences, Udayana UniversityThe 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.https://ojs.unud.ac.id/index.php/mtk/article/view/6308lobster graphmetric dimensionresolving set |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
PANDE GDE DONY GUMILAR LUH PUTU IDA HARINI KARTIKA SARI |
| spellingShingle |
PANDE GDE DONY GUMILAR LUH PUTU IDA HARINI KARTIKA SARI DIMENSI METRIK GRAPH LOBSTER Ln (q;r) E-Jurnal Matematika lobster graph metric dimension resolving set |
| author_facet |
PANDE GDE DONY GUMILAR LUH PUTU IDA HARINI KARTIKA SARI |
| author_sort |
PANDE GDE DONY GUMILAR |
| title |
DIMENSI METRIK GRAPH LOBSTER Ln (q;r) |
| title_short |
DIMENSI METRIK GRAPH LOBSTER Ln (q;r) |
| title_full |
DIMENSI METRIK GRAPH LOBSTER Ln (q;r) |
| title_fullStr |
DIMENSI METRIK GRAPH LOBSTER Ln (q;r) |
| title_full_unstemmed |
DIMENSI METRIK GRAPH LOBSTER Ln (q;r) |
| title_sort |
dimensi metrik graph lobster ln (q;r) |
| publisher |
Universitas Udayana |
| series |
E-Jurnal Matematika |
| issn |
2303-1751 |
| publishDate |
2013-05-01 |
| description |
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. |
| topic |
lobster graph metric dimension resolving set |
| url |
https://ojs.unud.ac.id/index.php/mtk/article/view/6308 |
| work_keys_str_mv |
AT pandegdedonygumilar dimensimetrikgraphlobsterlnqr AT luhputuidaharini dimensimetrikgraphlobsterlnqr AT kartikasari dimensimetrikgraphlobsterlnqr |
| _version_ |
1725586596295606272 |