Note on the relation between radius and diameter of a graph

Ferdinand Gliviak; Peter Kyš

Mathematica Bohemica (1995)

  • Volume: 120, Issue: 2, page 203-207
  • ISSN: 0862-7959

Abstract

top
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.

How to cite

top

Gliviak, Ferdinand, and Kyš, Peter. "Note on the relation between radius and diameter of a graph." Mathematica Bohemica 120.2 (1995): 203-207. <http://eudml.org/doc/247802>.

@article{Gliviak1995,
abstract = {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.},
author = {Gliviak, Ferdinand, Kyš, Peter},
journal = {Mathematica Bohemica},
keywords = {digraph; radius; diameter; graph; strong digraph; digraph; radius; diameter},
language = {eng},
number = {2},
pages = {203-207},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Note on the relation between radius and diameter of a graph},
url = {http://eudml.org/doc/247802},
volume = {120},
year = {1995},
}

TY - JOUR
AU - Gliviak, Ferdinand
AU - Kyš, Peter
TI - Note on the relation between radius and diameter of a graph
JO - Mathematica Bohemica
PY - 1995
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 120
IS - 2
SP - 203
EP - 207
AB - 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.
LA - eng
KW - digraph; radius; diameter; graph; strong digraph; digraph; radius; diameter
UR - http://eudml.org/doc/247802
ER -

References

top
  1. Buckley F., Harary F., Distance in Graph, Reading (MA 1989). Addison-Wesley. (1989) 
  2. Chartrand G., Lesniak L., Graphs and Digraphs, (second edition). Wadsworth and Brooks/Cole, Monterey, CA. Zbl1057.05001MR0834583
  3. Chartrand G., Tian L., Distance in digraphs, 15 p., Mathematics and Computer Models. Preprint. Zbl0903.05018MR1486881

NotesEmbed ?

top

You must be logged in to post comments.