文章基本信息

标题：Eccentric Digraph of Cocktail Party Graph and Hypercube
其他标题：Eccentric Digraph of Cocktail Party Graph and Hypercube
本地全文：下载
作者：Tri Atmojo Kusmayadi ; Nugroho Arif Sudibyo
期刊名称：Majalah Iptek = IPTEK : The Journal for Technology and Science
印刷版ISSN：0853-4098
电子版ISSN：2088-2033
出版年度：2011
卷号：22
期号：4
DOI：10.12962/j20882033.v22i4.74
语种：English
出版社：IPTEK
摘要：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 the 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. In this paper, we determine the eccentric digraph of a class of graph called the cocktail party graph and hypercube.
关键词：cocktail party graph; eccentric digraph; eccentricity; hypercube