The Eccentric Digraph of a Lintang Graph
| Main Authors: | Kusmayadi, Tri Atmojo, Fathmawatie, Fauziyyah |
|---|---|
| Format: | Lainnya PeerReviewed application/pdf |
| Terbitan: |
Universitas Sebelas Maret
, 2013
|
| Subjects: | |
| Online Access: |
http://eprints.uns.ac.id/828/1/196308261988031002MathInfo5.pdf http://eprints.uns.ac.id/828/ |
Daftar Isi:
- 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.