Abstract
The (directed) distance from a vertex u to a vertex v in a strong digraph D is the length of a shortest u-v (directed) path in D. The eccentricity of a vertex v of D is the distance from v to a vertex furthest from v in D. The radius radD is the minimum eccentricity among the vertices of D and the diameter diamD is the maximum eccentricity. A central vertex is a vertex with eccentricity radD and the subdigraph induced by the central vertices is the center C(D). For a central vertex v in a strong digraph D with radD < diamD, the central distance c(v) of v is the greatest nonnegative integer n such that whenever d(v, x) ≤ n, then x is in C(D). The maximum central distance among the central vertices of D is the ultraradius uradD and the subdigraph induced by the central vertices with central distance uradD is the ultracenter UC(D). For a given digraph D, the problem of determining a strong digraph H with UC(H) = D and C(H) ≠ D is studied. This problem is also considered for digraphs that are asymmetric.
Similar content being viewed by others
References
G. Chartrand, K. Novotny, and S.J. Winters: The ultracenter and central fringe of a graph. Networks. To appear.
G. Chartrand, G.L. Johns, and S. Tian: Directed distance in digraphs: centers and peripheries. Congr. Numer. 89 (1992), 89-95.
M.P. Shaikh: On digraphs with prescribed centers and peripheries. J. Undergrad. Math. 25 (1993), 31-42.
S.J. Winters: Distance Associated with Subgraphs and Subdigraphs. Ph.D. Dissertation, Western Michigan University, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chartrand, G., Gavlas, H., Schulz, K. et al. On strong digraphs with a prescribed ultracenter. Czechoslovak Mathematical Journal 47, 83–94 (1997). https://doi.org/10.1023/A:1022492121790
Issue Date:
DOI: https://doi.org/10.1023/A:1022492121790