EKSENTRIK DIGRAF DANPELABELAN KONSEKUTIF (CONSECUTIVE LABELING) PADA GRAF STAR S_n (n Bilangan Asli)
| Main Author: | AL KEDANG, BAHRUDIN |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2014
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/16035/ |
Daftar Isi:
- Graph theory is a topic that gets a lot of attention, because the models are very useful for applications,such as problems in communication networks, transportation, computer science, and so forth. One of the applications in graph theory include determining the farthest city(maximum shortest path) from one town to another. Distance(distance) d(u,v) between two point Sudan is the length of the shortest path from point u to point v in G.The eccentricity point v in a graph G, denotedec(v) is the farthest distance(maximum shortest path) from v to any point in G.the point v is an eccentric poin to fuif the distance from v to equal to the eccentricity of uord(v, u) =ec(u). Eccentric digraph ED(G) ona graph is defined as the graph which has the same vertex set G or V(ED (G)) =V(G) where the arc connecting a point u to v, if v is an eccentric point of u. Labeling of a graph G is a mapping that maps the graph elements to numbers(generally non-negative integers or positive) is called the label. The domain of this mapping is the set point(labeling point), set side(side labeling), or the set of vertices and edges(total labeling). Consecutive labeling of a graph G is a function bijektif of V(G) E(G)to the set of positive integers{1,2,Â...,p+1,p+2,Â...,p+q} such that the label side is the absolute price point of difference between the two labels are connected byedge e is f(ei) = f(uv) = = | f(u) - f(v)|. This research will be discussed eccentric digraph sand label in consecutive star graph S_with natural numbers. Eccentric digraph ED〖(S〗_n)of the star graph is a digraph with vertex set V(ED〖(S〗_n)) = {vo, v1, v2,Â...,vn-1}and the set of arcs(directed side). 〖v_0 v〗_j for j = 1,2,3,Â...,n-1 A(ED(Sn)) = 〖v_i v〗_j for i, j = 1, 2, 3, Â..., n-1 i ≠ j. Label ingconsecutive star graph S_n, is defined as follows: f(vi) = 2i – 1 , 1 ≤ i ≤ n + 1 f(ei) = f(v1vi+1) , 1 ≤ i ≤ n