Products and Eccentric Diagraphs
Medha Itagi Huilgol, Syed Asif Ulla S.
Journal of Advances in Mathematics and Computer Science · pp. 805–816 · Published 16 Jan 2014
10.9734/BJMCS/2014/6348Abstract
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.
Cited by 0
No indexed citations yet.
Related research
- On Cartesian Products of Any Finite Number of Orthogonal Double Covers — shares topic coverage
- A Constructive Method for Using Known Groups as Building Blocks to form More Groups — shares topic coverage
- The Domination Number of Pm x Pn — shares topic coverage
- Transitivity Action of the Cartesian Product of the Alternating Group Acting on a Cartesian Product of Ordered Sets of Triples — shares topic coverage
- Global Clustering Coefficient of the Products of Complete Graphs — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.