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.
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
Peter Horák (1983)
Mathematica Slovaca
Similarity:
H. Galeana-Sánchez (1998)
Discussiones Mathematicae Graph Theory
Similarity:
We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and sufficient condition for a digraph to have the following property: "In any induced subdigraph H of D, every maximal independent set meets every non-augmentable path". Also we obtain a necessary and sufficient condition for any orientation of a graph G results a digraph with the above property. The property studied in this paper is an instance of the property of a conjecture of J.M. Laborde,...
Mieczysław Borowiecki, Danuta Michalak (1989)
Banach Center Publications
Similarity: