arXiv:1202.5720 [math.CO]AbstractReferencesReviewsResources
When is the Direct Product of Generalized Mycielskians a Cover Graph?
Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
Published 2012-02-26Version 1
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_i,h_s)(g_j,h_t): g_ig_j belongs to E(G) and h_sh_t belongs to E(H)}. We prove that the direct product M_m(G) X M_n(H) of the generalized Mycielskians of G and H is a cover graph if and only if G or H is bipartite.
Related articles: Most relevant | Search more
arXiv:2203.12397 [math.CO] (Published 2022-03-23)
On independent domination in direct products
arXiv:1501.07335 [math.CO] (Published 2015-01-29)
$L(1,1)-$ Labeling of Direct Product of Cycles
arXiv:1007.0797 [math.CO] (Published 2010-07-06)
Independent Sets in Direct Products of Vertex-transitive Graphs