DIMENSI METRIK DAN DIAMETER DARI GRAF ULAT Cm, n
Abstract: Graf is a pair (V,E)
where V set of vertices is not empty and E set side. Let u and v are the
vertices in a connected graph G, then the distance d (u, v) is thelength of the
shortest path between u and v in G. The diameter of graph G is the maximum
distance of d (u, v) .For the set of ordered � ={�1, �2, �3, �4, …
… . , ��} of vertices in a
connected graph G and vertex� ∈ �(�) , the representation of v to W is �(�|�) = (�(�,
�1), �(�,
�2), �(�,
�3), … … … , �(�, ��)).
If r (v│W) for each node v∈V (G) are
different, then W is called the set of variants from G and the minimum
cardinality of the set differentiator is referred to as the metricdimensions.
Based on the characteristics of the vertices and sides of the graphhave many
types of them are caterpillars and graph graph fireworks, which both have in
common at the center of the graph shaped trajectory and earring starshaped
graph. In this paper will prove that Graf caterpillar (��,�)with
� ≥ 1, � ≥
2 has diameter � + 1 and metric dimensions
�(� − 1) .
Penulis: Restu Ria Wantika
Kode Jurnal: jpmatematikadd160857
