Eccentric Digraph of Cocktail Party Graph and Hypercube
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, deno...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Research and Public Services
2011-11-01
|
| Series: | IPTEK: The Journal for Technology and Science |
| Subjects: | |
| Online Access: | http://iptek.its.ac.id/index.php/jts/article/view/74/65 |