Boundary-type Sets of Strong Product of Directed Graphs

arXiv1911.03637MaRDI QIDQ6328834FDOQ6328834

Authors: G. N. Prasanth, Bijo S. Anand, Mary Shalet T J 

Publication date: 9 November 2019

Abstract: Let $D=(V,E)$ be a strongly connected digraph and let $u,vinV(D)$. The maximum distance $md(u,v)$ is defined as\ $md(u,v)$=max{$overrightarrowd(u,v),overrightarrowd(v,u)$} where $overrightarrowd(u,v)$ denote the length of a shortest directed $u-v$ path in $D$. This is a metric. The boundary, contour, eccentric and peripheral sets of a strong digraph $D$ with respect to this metric have been defined, and the above said metrically defined sets of a large strong digraph $D$ have been investigated in terms of the factors in its prime factor decomposition with respect to Cartesian product. In this paper we investigate about the above boundary-type sets of a strong digraph $D$ in terms of the factors in its prime factor decomposition with respect to strong product.

This page was built for publication: Boundary-type Sets of Strong Product of Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6328834)