On strong distances in oriented graphs
type: Item
instance of: scholarly article
title: On strong distances in oriented graphs
zbMATH Open document ID: 1025.05020
DOI: 10.1016/S0012-365X(02)00807-5
author: Peter Dankelmann
author: H. C. Swart
author: David Day
published in: Discrete Mathematics
publication date: 2003-06-09T00:00:00Z
review text: Let \(D\) be a strongly connected digraph. The strong distance between two vertices \(u\) and \(v\) in \(D\) is the minimum size of a strongly connected subdigraph of \(D\) containing \(u\) and \(v\). The authors also define the strong connectivity, strong diameter and strong radius. The main results of the paper are: (a) estimation of the strong diameter of \(D\) using either an order and directed girth of \(D\) (Theorem 1) or an order and strong connectivity of \(D\) (Theorem 2); (b) estimation of the strong radius of \(D\).
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1924765
zbMATH Keywords: directed graph
zbMATH Keywords: distance
zbMATH Keywords: strong distance
zbMATH Keywords: strong diameter
zbMATH Keywords: strong connectivity
zbMATH Keywords: strong radius
reviewed by: Ferdinand Gliviak
MaRDI profile type: Publication
cites work: Q4943511
cites work: Q4949775
cites work: Q3818315
description: scientific article; zbMATH DE number 1924765