Digraph eksentris dari turnamen transitif dan regular
| Main Author: | Iswadi, Hazrul |
|---|---|
| Format: | Article PeerReviewed application/pdf |
| Terbitan: |
FMIPA Unair
, 2003
|
| Subjects: | |
| Online Access: |
http://repository.ubaya.ac.id/196/1/hazrul_Digraph%20eksentris%20dari%20turnamen%20transitif%20dan%20regular_2003.pdf http://repository.ubaya.ac.id/196/ |
Daftar Isi:
- Eccentricity e(u) of vertex u is the maximum distance from u to any other vertices in digraph G. A vertex v is an eccentric vertex of u if the distance from u is equal to e(u). Eccentric digraph ED(G) of digraph G is the digraph that have the same vertices with G and there is an arc from u to v if and only if v is an eccentric vertex of u. Tournament T = (V,E) with order n is a digraph without loop such that every pair vertices i and j joined with one and only one an arc (i,j) or (j,i). Tournament T is called transitive if there are arc (u,v) and (v,w) in T then (u,w) also and arc in T and is called regular if it have n odd order with each vertex joined to and from (n-1)/2 another vertices in T. In this paper, we consider the iteration properties of eccentric digraph of transitive and regular tournament