On the Diameter of a p-Cyclic Strongly Connected Digraph
Keyword(s):
In this paper we follow the notation of (2). In (5), Luce showed, in other terminology, that if d is the diameter of a strongly connected digraph, D, on n vertices with m edges, then1.1this inequality being sharp; from (1.1) one may immediately derive sharp upper bounds for d in terms of m and n, this being a generalization of the obvious and well-known inequality1.2
2016 ◽
Vol 08
(02)
◽
pp. 1650022
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
2011 ◽
Vol 5
(1)
◽
pp. 37-45
◽