Journal of Combinatorics, Information & System Sciences : (A Quarterly International Scientific Journal)
Published in Association with Forum for Interdisciplinary Mathematics
Current Volume: 47 (2022 )
ISSN: 0250-9628
e-ISSN: 0976-3473
Periodicity: Quarterly
Month(s) of Publication: March, June, September & December
Subject: Mathematics
DOI: 10.32381/JCISS
Online Access is free for all life members of JCISS.
Planarity of Eccentric Digraph of Graphs
By : Syed Asif Ulla S , Medha Itagi Huilgol
Page No: 33-47
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.
Authors :
Medha Itagi Huilgol and Syed Asif Ulla S. : Department Of Mathematics, Bangalore University, Central College Campus, Bangalore - 560 001, India.