Partial cubes are graphs that can be isometrically embedded into hypercubes. Convex cycles play an important role in the study of partial cubes. In this paper, we prove that a regular partial cube is a hypercube (resp., a Doubled Odd graph, an even cycle of length where ) if and only if all its convex cycles are 4‐cycles (resp., 6‐cycles, ‐cycles). In particular, the partial cubes whose all convex cycles are 4‐cycles are equivalent to almost‐median graphs. Therefore, we conclude that regular almost‐median graphs are exactly hypercubes, which generalizes the result by Mulder—regular median graphs are hypercubes.
No takes yet. Share an insight, caveat, or question.
Xie et al. (2024) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: