Distance in Graphs

DOI10.1007/978-0-8176-4789-6_3zbMath1221.05113OpenAlexW100212838MaRDI QIDQ3064395

Wayne Goddard, Ortrud R. Oellermann

Publication date: 21 December 2010

Published in: Structural Analysis of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-8176-4789-6_3

zbMATH Keywords

graphdistancediameterradiusSteiner distance

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

The Steiner Wiener index of a graph, On maximum Wiener index of directed grids, Orientations of graphs with maximum Wiener index, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, Steiner 4-diameter, maximum degree and size of a graph, Diameter of nanotori, On the distance between random events on a network, Inverse problem on the Steiner Wiener index, Unnamed Item, Mean distance on metric graphs, Focusing the argumentative process: neighborhood-based semantics in abstract argumentation, On transit functions in weighted graphs, Unnamed Item, On Steiner degree distance of trees, Some remarks on Wiener index of oriented graphs, Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs, Proximity semantics for topic-based abstract argumentation, Unnamed Item, Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond, Nordhaus-Gaddum Type results for the Harary index of graphs, A note on Steiner reciprocal degree distance