Vertex and Arc Counts in Cartesian, Lexicographic and Strong Products of Digraphs
摘要
In graph theory, the concept of graph product involves a way to combine two graphs using a binary operation. Similarly, in the realm of digraphs, analogous product operations can be defined. Various authors have explored such operations in digraphs, including the Cartesian product, lexicographic product, and strong product. This paper delves into examining properties of these product operations, such as the number of vertices, arcs, and the summation of different degrees.