A Lexicographic Product Cancellation Property for Digraphs
Kendall Lee Manion
The paper concludes by proving a cancellation property for the lexicographic product of digraphs $G$, $H$, $A$, and $B$: if $G \circ H \cong A \circ B$ and $[piping symbol]V(G) [piping symbol]= [piping symbol]V(A)[piping symbol]$, then $G ...