The Eccentric Digraph of a Lintang Graph

Kusmayadi, Tri Atmojo and Fathmawatie, Fauziyyah (2013) The Eccentric Digraph of a Lintang Graph. Universitas Sebelas Maret.

[img] PDF (The Eccentric Digraph of a Lintang Graph)
Download (78Kb)

    Abstract

    Let G be a graph with a set of vertices V(G) and a set of edges E(G). The distance from vertex u to vertex v in G, denoted by d(u,v), is a length of the shortest path from vertex u to v. The eccentricity of vertex u in graph G is the maximum distance from vertex u to any other vertices in G, denoted by e(u). Vertex v is an eccentric vertex from u if d(u,v) =e(u). The eccentric digraph ED(G) of a graph G is a graph that has the same set of vertices as G, and there is an arc (directed edge) joining vertex u to v if v is an eccentric vertex from u. Boland and Miller [1] introduced the eccentric digraph of a digraph. They also proposed an open problem to find the eccentric digraph of various classes of graphs. In this paper, we tackle this open problem for the class of lintang graph. Key words : eccentricity,eccentric digraph, lintang graph.

    Item Type: Other
    Subjects: Q Science > QA Mathematics
    Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika
    Depositing User: mr azis r
    Date Deposited: 22 May 2013 19:11
    Last Modified: 17 Mar 2017 12:07
    URI: https://eprints.uns.ac.id/id/eprint/828

    Actions (login required)

    View Item