TITLE

PLANARITY OF ECCENTRIC DIGRAPH OF GRAPHS

AUTHOR(S)
HUILGOL, MEDHA ITAGI; ULLA S., SYED ASIF
PUB. DATE
January 2014
SOURCE
Journal of Combinatorics & System Sciences;2014, Vol. 39 Issue 1/4, p33
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. A vertex v is an eccentric vertex of vertex u if the distance from u to v is equal to e(u). The eccentric digraph ED(G) of a graph(digraph) G is the digraph that has the same vertex set as G and an arc from u to v exists in ED(G) if and only if v is an eccentric vertex of u in G. In this paper, we consider planarity of eccentric digraph of a graph.
ACCESSION #
109414647

 

Share

Read the Article

Courtesy of NEW JERSEY STATE LIBRARY

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics