Pramesti, Enggar (2008) EKSENTRIK DIGRAF DARI GRAF STAR DAN GRAF DOUBLE STAR. Other thesis, University of Muhammadiyah Malang.
Download (50kB) | Preview
A graph is objects gathering is called dot (vertex or node) what in circuit by sides (edge). Usually graph described as by dots corps (symbolizing vertex) connective by lines (symbolizing edge). Graph theory in this time become topic which getting many attentions, because model which on graph theory good for wide of application, like communications network internal issue, transportation, computer science, electrics network, and problem mapping of road in a town. One of the benefit in graph theory is to determine furthermost town for short trajectory from a town to other town consisting of town corps in an area. Apart between two dot of u and of v is short path length of dot of u to v that written with d(u,v). If there no trajectory of u to v, hence . Eccentricity of u, written with e(u) is maximum distance of dot of u to every other dot in graph G. Dot of v referred as eccentric dot of u if distance between dot of u to the v is equal to his eccentricity. Eccentric digraph of ED(G) at graph of G defined as graph having dot gathering which is equal to dot gathering in G or , and side instruct (arc) of dot of u to v if v is eccentric dot of u. Problem which studied in final duty is to determine eccentric graph of graph star and graph double star.
|Item Type:||Thesis (Other)|
|Subjects:||L Education > L Education (General)|
|Divisions:||Faculty of Teacher Training and Education > Department of Mathematics and Computing|
|Depositing User:||Anggit Aldila|
|Date Deposited:||06 Jun 2012 02:49|
|Last Modified:||06 Jun 2012 02:49|
Actions (login required)