Goddard, Wayne; Oellermann, Ortrud R. Distance in graphs. (English) Zbl 1221.05113 Dehmer, Matthias (ed.), Structural analysis of complex networks. Basel: Birkhäuser (ISBN 978-0-8176-4788-9/hbk; 978-0-8176-4789-6/ebook). 49-72 (2011). Summary: The distance between two vertices is the basis of the definition of several graph parameters including diameter, radius, average distance and metric dimension. These invariants are examined, especially how they relate to one another and to other graph invariants and their behaviour in certain graph classes. We also discuss characterizations of graph classes described in terms of distance or shortest paths. Finally, generalizations are considered.For the entire collection see [Zbl 1201.05002]. Cited in 20 Documents MSC: 05C12 Distance in graphs 05C20 Directed graphs (digraphs), tournaments 05C38 Paths and cycles Keywords:graph; distance; diameter; radius; Steiner distance PDFBibTeX XMLCite \textit{W. Goddard} and \textit{O. R. Oellermann}, in: Structural analysis of complex networks. Basel: Birkhäuser. 49--72 (2011; Zbl 1221.05113) Full Text: DOI