2019/11/09 by Prasanth G. Narasimha-Shenoi, Narasimha-Shenoi, Prasanth G., Bijo S Anand +3
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1911.03637
arxiv created 2019/11/09 · arxiv updated 2019/11/12
Let D=(V,E) be a strongly connected digraph and let u ,v∈ V(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.