THE ECCENTRIC DIGRAPH OF FRIENDSHIP GRAPH, AND FIRECRACKER GRAPH

Kusmayadi, Tri Atmojo (2011) THE ECCENTRIC DIGRAPH OF FRIENDSHIP GRAPH, AND FIRECRACKER GRAPH. .

[img]
Preview
PDF - Published Version
Download (36Kb) | Preview

    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. The purposes of this reserarch are to determine the eccentric digraphs of some classes of graphs, in particular the friendship graphs, and the firecracker graphs.

    Item Type: Article
    Subjects: Q Science > QA Mathematics
    Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika
    Depositing User: Miftahful Purnanda
    Date Deposited: 16 Apr 2014 17:26
    Last Modified: 16 Apr 2014 17:26
    URI: https://eprints.uns.ac.id/id/eprint/11478

    Actions (login required)

    View Item