English

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'

Combinatorics 2025-10-24 v1 Discrete Mathematics

Abstract

Suppose D=(V,E)D = (V, E) is a strongly connected digraph and u,vV(D)u, v \in V (D). Among the many metrics in graphs, the sum metric warrants further exploration. The sum distance sd(u,v)sd(u, v) defined as sd(u,v)=d(u,v)+d(v,u)sd(u, v) =\overrightarrow{d}(u, v)+\overrightarrow{d}(v, u) is a metric where d(u,v)\overrightarrow{d}(u, v) denotes the length of the shortest directed uvu - v path in DD. 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.

Keywords

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