2016/09/11 by Manoj Changat, Changat, Manoj, Prasanth G. Narasimha-Shenoi +6
Computer Science · Mathematics · #Advanced Graph Theory Research #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Graph theory and applications #cs.DM
paper · pdf · doi:10.48550/arxiv.1609.03110
arxiv created 2016/09/11 · openalex publication_date 2016/09/11 · arxiv updated 2016/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Suppose that D=(V,E) is a strongly connected digraph. 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 are defined with respect to this metric. The main aim of this paper is to identify the above said metrically defined sets of a large strong digraph D in terms of its prime factor decomposition with respect to cartesian product.