## The Diameter of Graphs and Digraphs

- April 16, 2018
- 4 p.m.
- LeConte 317R

## Abstract

Distance based graph invariants have been studied for the almost since the inception of graph theory, and among those the diameter, defined as the largest of the distances between all pairs of vertices in connected graph or strong digraph, has received much attention. In this talk we present some old but possibly not well-known results on the diameter of graphs, as well as several recent results. A special focus will be on results on the diameter of digraphs, a topic which has received much less attention in the literature than the diameter of graphs.