Kusmayadi, Tri Atmojo and Sudibyo, Nugroho Arif and Kuntari, Sri (2013) THE ECCENTRIC DIGRAPH OF ( ) t n, -KITE GRAPH. Far East Journal of Mathematical Sciences (FJMS) , 74 (2). pp. 369-378.

PDF - Published Version
Download (79Kb) | Preview


    Let G be a graph with a set of vertices ( ) G V and a set of edges (). G E The distance from vertex u to vertex v in G is the length of the shortest path from vertex u to v. The eccentricity ( ) u e of a vertex u is the maximum distance of u to any other vertices of G. A vertex v is an eccentric vertex of vertex u if the distance from u to v is equal to (). u e The eccentric digraph ( ) G ED of a graph G is the digraph that has the same set of vertices as G, and there is an arc (directed edge) from u to v in () G ED if and only if v is an eccentric vertex of u in G.

    Item Type: Article
    Subjects: Q Science > Q Science (General)
    Q Science > QA Mathematics
    Divisions: Lembaga Penelitian dan Pengabdian Kepada Masyarakat - LPPM
    Depositing User: Anis Fagustina
    Date Deposited: 09 May 2014 16:25
    Last Modified: 09 May 2014 16:25

    Actions (login required)

    View Item