Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
Abstract
Suppose D = (V, E) is a strongly connected digraph and u, v ∈ V (D). Among the many metrics in graphs, the sum metric warrants further exploration. The sum distance sd(u, v) defined as sd(u, v) =d(u, v)+d(v, u) is a metric where d(u, v) denotes the length of the shortest directed u - v path in D. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.