Open AccessDIMENSI METRIK DAN DIAMETER DARI GRAF ULAT Cm,n
Author(s) -
Restu Ria Wantika
Publication year - 2017
Publication title -
buana matematika/buana matematika : jurnal ilmiah matematika dan pendidikan matematika
Language(s) - English
Resource type - Journals
eISSN - 2598-8077
pISSN - 2088-3021
DOI - 10.36456/buanamatematika.v6i1:.456
Subject(s) - combinatorics , mathematics , distance regular graph , bound graph , complement graph , wheel graph , graph , graph power , butterfly graph , vertex (graph theory) , path graph , discrete mathematics , voltage graph , line graph
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 the length 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 of vertices in a connected graph G and vertex , the representation of v to W is . 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 metric dimensions. Based on the characteristics of the vertices and sides of the graph have 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 star-shaped graph. In this paper will prove that Graf caterpillar with has diameter and metric dimensions . Keywords: dimensional graph, graph diameter, star graph, graph caterpillar ..