The inradius of a strongly connected digraph (strong digraph) is the minimum, over all vertices 
, of the maximum directed distance from another vertex to 
(Harary et al. 1965, p. 162;
Harary and Palmer 1973, p. 266).
Digraph Inradius
See also
Digraph Outradius, Graph Radius, Strongly Connected DigraphExplore with Wolfram|Alpha
References
Harary, F.; Norman, R. Z.; and Cartwright, D. Structural Models: An Introduction to the Theory of Directed Graphs. New York: Wiley, 1965.Harary, F. and Palmer, E. M. "A Survey of Graphical Enumeration Problems." In A Survey of Combinatorial Theory (Ed. J. N. Srivastava). Amsterdam, Netherlands: North-Holland, pp. 259-275, 1973.Cite this as:
Weisstein, Eric W. "Digraph Inradius." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DigraphInradius.html