When is the Direct Product of Generalized Mycielskians a Cover Graph?
Lai, Hsin-Hao · Lih, Ko-Wei · Lin, Chen-Ying · Tong, Li-Da
Original · EN
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph having vertex set V(G) X V(H) and edge set E(G X H) = (gᵢ,hₛ)(gⱼ,hₜ): gᵢgⱼ belongs to E(G) and hₛhₜ belongs to E(H). We prove that the direct product Mₘ(G) X Mₙ(H) of the generalized Mycielskians of G and H is a cover graph if and only if G or H is bipartite.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.