Add to ORKGA k-king in a digraph D is a vertex that can reach every other vertex in D by a directed path of length at most k. A king is a vertex that is a k-king for some k. We will look at kings in the direct product of digraphs and characterize a relationship between kings in the product and kings in the factors. This is a continuation of a project in which a similar characterization is found for the cartesian product of digraphs, the strong product of digraphs, and the lexicographic product of digraphs
Abstract. Let G = (V,E) be a simple graph without isolated vertices and minimum degree δ(G), and let...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
In this paper we study reachability relations on vertices of digraphs, informally defined as follows...
A k-king in a digraph D is a vertex that can reach every other vertex in D by a directed path of len...
AbstractA k-king in a digraph D is a vertex which can reach every other vertex by a directed path of...
In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach e...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
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 o...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. A vertex ...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
A king in a directed graph is a node from which each node in the graph can be reached via paths of ...
In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach e...
AbstractIf D is a digraph, then K⊆V(D) is a king set of D if D[K] is discrete and for each y∈V(D)-K ...
Abstract. Let G = (V,E) be a simple graph without isolated vertices and minimum degree δ(G), and let...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
In this paper we study reachability relations on vertices of digraphs, informally defined as follows...
A k-king in a digraph D is a vertex that can reach every other vertex in D by a directed path of len...
AbstractA k-king in a digraph D is a vertex which can reach every other vertex by a directed path of...
In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach e...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
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 o...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. A vertex ...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
A king in a directed graph is a node from which each node in the graph can be reached via paths of ...
In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach e...
AbstractIf D is a digraph, then K⊆V(D) is a king set of D if D[K] is discrete and for each y∈V(D)-K ...
Abstract. Let G = (V,E) be a simple graph without isolated vertices and minimum degree δ(G), and let...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
In this paper we study reachability relations on vertices of digraphs, informally defined as follows...