Distance in digraphs
type: Item
instance of: scholarly article
title: Distance in digraphs
zbMATH Open document ID: 0903.05018
DOI: 10.1016/S0898-1221(97)00216-2
author: Gary Chartrand
author: Songlin Tian
publication date: 1998-06-11T00:00:00Z
review text: The authors recall known results concerning distance in a graph and standard distance in a digraph. They define two new distances in strong digraphs: \(d_{\max} (u,v)= \max (d(u,v),\;d(v,u))\) and \(d_{\text{sum}} (u,v)= d(u,v) +d(v,u)\). Several results and problems concerning these distances and parameters such as center, median, and periphery are described.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1164075
zbMATH Keywords: distance
zbMATH Keywords: digraph
reviewed by: Ferdinand Gliviak
MaRDI profile type: Publication
cites work: The dissimilarity characteristic of Husimi trees
cites work: Q4692391
cites work: On graphs containing a given graph as center
cites work: Q3686741
cites work: Medians of arbitrary graphs
cites work: On graphs with prescribed median I
cites work: Q3976647
cites work: Q4021399
cites work: Q5284065
full work available at URL: s0898-1221(97)00216-2
OpenAlex ID: W2038943847
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1164075