When is the Direct Product of Generalized Mycielskians a Cover Graph?

Details When is the Direct Product of Generalized Mycielskians a Cover Graph? When is the Direct Product of Generalized Mycielskians a Cover Graph?

2012-02-26

arxiv.org/abs/1202.5720v1

Mathematics

Combinatorics

9 pages, accepted by Ars Combinatoria on May 13, 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

When is the Direct Product of Generalized Mycielskians a Cover Graph? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When is the Direct Product of Generalized Mycielskians a Cover Graph?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When is the Direct Product of Generalized Mycielskians a Cover Graph? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-215660