TITLE

Products and Eccentric Diagraphs

AUTHOR(S)
Medha Itagi Huilgol; S. Syed Asif Ulla
PUB. DATE
March 2014
SOURCE
British Journal of Mathematics & Computer Science;2014, Vol. 4 Issue 6, p805
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 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 the eccentric digraphs of different products of graphs, viz., cartesian, normal, lexicographic, prism, etc.
ACCESSION #
95787392

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics