Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
Combinatorics
2025-10-24 v1 Discrete Mathematics
Abstract
Suppose is a strongly connected digraph and . Among the many metrics in graphs, the sum metric warrants further exploration. The sum distance defined as is a metric where denotes the length of the shortest directed path in . The four main boundary vertices in the digraphs are ``boundary vertices, contour vertices, eccentric vertices'', and ``peripheral vertices'' and their relationships have been studied. Also, an attempt is made to study the boundary-type sets of corona product of (di)graphs. The center of the corona product of two strongly connected digraphs is established. All the boundary-type sets and the center of the corona product are established in terms of factor digraphs.
Cite
@article{arxiv.2510.20226,
title = {Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'},
author = {Bijo S. Anand and Manoj Changat and Prasanth G. Narasimha-Shenoi and Mary Shalet Thottungal Joseph and Mithra R and Prakash G. Narasimha-Shenoi},
journal= {arXiv preprint arXiv:2510.20226},
year = {2025}
}
Comments
15 pages