Boundary-type sets of strong product of directed graphs
DOI:
https://doi.org/10.26493/1855-3974.2229.5f1Keywords:
Maximum distance, boundary-type sets, strongly connected digraph, strong productAbstract
Let D = (V, E) be a strongly connected digraph and let u and v be two vertices in D. The maximum distance md(u, v) is defined as md(u, v) = max {d→(u, v), d→(v, u)}, where d→(u, v) denotes the length of a shortest directed u-v path in D. This is a metric. The boundary, contour, eccentricity and periphery sets of a strongly connected digraph D with respect to this metric have been defined. The boundary-type sets of the strong product of two digraphs is investigated in this article.
Downloads
Published
2021-03-11
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/