DIMENSI METRIK PADA GRAF Rn(q; r)m | Zendy

Rendy Aditya Pratama | Zendy; Narwen Narwen | Zendy; Des Welyyanti | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

DIMENSI METRIK PADA GRAF Rn(q; r)m

Author(s) -

Rendy Aditya Pratama,

Narwen Narwen,

Des Welyyanti

Publication year - 2019

Publication title -

jurnal matematika unand

Language(s) - English

Resource type - Journals

eISSN - 2721-9410

pISSN - 2303-291X

DOI - 10.25077/jmu.8.1.260-267.2019

Subject(s) - combinatorics , graph , mathematics , metric dimension , dimension (graph theory) , distance regular graph , discrete mathematics , graph power , line graph , 1 planar graph

The metric dimension of a connected graph G is the cardinality of minimum resolving set in graph G. In this research, how to find the metric dimension of Rn(q; r)m graph. Rn(q; r)m graph is constructing by subdivision operation on Lobster graph Ln(q; r). We obtain the metric dimension of Rn(1; 1)m graph for n > 2 is 2, the metric dimension of Rn(q; 1)m for n ≥ 2, q ≥ 2 is n(q − 1) and the metric dimension Rn(q; r)m graph for n ≥ 2, q ≥ 1 and r ≥ 2 is nq(r − 1).Kata Kunci: graf Rn(q; r)m , dimensi metrik, himpunan pemisah

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research