Which directed graphs have a solution?
Mehdi Behzad, Frank Harary (1977)
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.
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
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...
Halina Bielak, Elżbieta Soczewińska (1983)
Časopis pro pěstování matematiky
Similarity:
Bhargava, T.N., O'Korn, L.J. (1967)
Portugaliae mathematica
Similarity:
Baskoro, E.T., Miller, M., Širáň, J. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Matúš Harminc, Roman Soták (1999)
Discussiones Mathematicae Graph Theory
Similarity:
For given nonnegative integers k,s an upper bound on the minimum number of vertices of a strongly connected digraph with exactly k kernels and s solutions is presented.