Kusmayadi , Tri Atmojo and Sudibyo, Nugroho Arif (2012) *THE ECCENTRIC DIGRAPH OF FRIENDSHIP GRAPH AND FIRECRACKER GRAPH.* Far East Journal of Mathematical Sciences (FJMS), 63 (2). pp. 221-234. ISSN 0972-0871

| PDF - Published Version Download (155Kb) | Preview |

## Abstract

Let G be a graph with a set of vertices and a set of edges Then the distance from vertex u to vertex v in G, denoted by is the length of the shortest path from vertex u to v. The eccentricity of vertex u in a graph G is the maximum distance from vertex u to any other vertices in G, denoted by Vertex v is an eccentric vertex from u if The eccentric digraph 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. In this paper, we determine the eccentric digraph of a class of graphs called the friendship graph and firecracker graph

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: | 08 May 2014 09:45 |

Last Modified: | 08 May 2014 09:45 |

URI: | https://eprints.uns.ac.id/id/eprint/15375 |

### Actions (login required)

View Item |