Digraphs maximal with respect to arc connectivity
Peter Horák (1982)
Mathematica Slovaca
Similarity:
Peter Horák (1982)
Mathematica Slovaca
Similarity:
Peter Horák (1979)
Mathematica Slovaca
Similarity:
Ferdinand Gliviak, Peter Kyš (1995)
Mathematica Bohemica
Similarity:
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.