About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Gliviak, Ferdinand ; Kyš, Peter
Note on the relation between radius and diameter of a graph. (English). Mathematica Bohemica, vol. 120 (1995), issue 2, pp. 203-207
MSC: 05C12, 05C20 | MR 1357602 | Zbl 0837.05052 | DOI: 10.21136/MB.1995.126222
Keywords:
digraph; radius; diameter; graph; strong digraph
Summary:
The known relation between the standard radius and diameter holds for graphs, but not for digraphs. We show that no upper estimation is possible for digraphs. We also give some remarks on distances, which are either metric or non-metric.
References:
[1] Buckley F., Harary F.: Distance in Graph. Reading (MA 1989). Addison-Wesley.
[2] Chartrand G., Lesniak L.: Graphs and Digraphs. (second edition). Wadsworth and Brooks/Cole, Monterey, CA. MR 0834583 | Zbl 1057.05001
[3] Chartrand G., Tian L.: Distance in digraphs. 15 p., Mathematics and Computer Models. Preprint. MR 1486881 | Zbl 0903.05018
Partner of
EuDML logo