A note on removing a point of a strong digraph
Peter Horák (1983)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Peter Horák (1983)
Mathematica Slovaca
Similarity:
Martin Knor, L'udovít Niepel (1996)
Discussiones Mathematicae Graph Theory
Similarity:
We show that the out-radius and the radius grow linearly, or "almost" linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
Abas, M. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Mieczysław Borowiecki, Danuta Michalak (1989)
Banach Center Publications
Similarity:
Hortensia Galeana-Sanchez, Laura Pastrana (2009)
Discussiones Mathematicae Graph Theory
Similarity:
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel of D if it satisfies the following two conditions: for every pair of different vertices u,v ∈ N it holds that every directed path between them has length at least k and for every vertex x ∈ V(D)-N there is a vertex y ∈ N such that there is an xy-directed path of length at most k-1. In this paper, we consider some operations on digraphs and prove the existence of k-kernels in digraphs formed...
Zdzisław Skupień (1999)
Discussiones Mathematicae Graph Theory
Similarity: