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.

生成讲解博客的中文版本

生成AI智能校验的中文版本