Open AccessProducts and Eccentric Diagraphs
Author(s) -
Medha Itagi Huilgol
Publication year - 2014
Publication title -
british journal of mathematics and computer science
Language(s) - English
Resource type - Journals
ISSN - 2231-0851
DOI - 10.9734/bjmcs/2014/6348
Subject(s) - vertex (graph theory) , combinatorics , mathematics , eccentric , digraph , lexicographical order , cartesian product , graph , neighbourhood (mathematics) , physics , mathematical analysis , quantum mechanics
The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. A vertex\udv is an eccentric vertex of vertex u if the distance from u to v is equal to e(u). The eccentric digraph\udED(G) of a graph(digraph) G is the digraph that has the same vertex as G and an arc from u to\udv exists in ED(G) if and only if v is an eccentric vertex of u in G. In this paper, we consider the\udeccentric digraphs of different products of graphs, viz., cartesian, normal, lexicographic, prism, et