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
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
A tournament is an orientation of a complete graph. We say that a vertex x in a tournament T ⃗ contr...
AbstractReid [Every vertex a king, Discrete Math. 38 (1982) 93–98] showed that a non-trivial tournam...
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...
In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach e...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
This paper discusses the direct product cancellation of digraphs. We define the exact conditions on ...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
A king in a directed graph is a node from which each node in the graph can be reached via paths of ...
Abstract. Let G = (V,E) be a simple graph without isolated vertices and minimum degree δ(G), and let...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
A tournament is an orientation of a complete graph. We say that a vertex x in a tournament T ⃗ contr...
AbstractReid [Every vertex a king, Discrete Math. 38 (1982) 93–98] showed that a non-trivial tournam...
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...
In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach e...
AbstractA king in a directed graph is a vertex from which each vertex in the graph can be reached th...
This paper discusses the direct product cancellation of digraphs. We define the exact conditions on ...
AbstractKoh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submi...
A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutua...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
A king in a directed graph is a node from which each node in the graph can be reached via paths of ...
Abstract. Let G = (V,E) be a simple graph without isolated vertices and minimum degree δ(G), and let...
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
A tournament is an orientation of a complete graph. We say that a vertex x in a tournament T ⃗ contr...
AbstractReid [Every vertex a king, Discrete Math. 38 (1982) 93–98] showed that a non-trivial tournam...