Sorry, we do not have enough data to show an influence graph for this author.
For the lexicographic product G • H of two graphs G and H so that G is connected, we prove that if the copnumber c(G) of G is greater than or equal to 2, then c(G • H) = c(G). Moreover, if c(G) = c(H) = 1, then c(G • H) = 1. If c(G) = 1, G has more than one vertex, and c(H) ≥ 2, then c(G • H) = 2. We also provide the copnumber for general lexicographic… (More)