Two characterizations of hypercubes

MaRDI QIDQ540098zbMATH OpenFDO

Authors J. Nieminen, Matti Peltola, Pasi Ruotsalainen

Publication date 1 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/231935, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p97.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Review text

Summary: Two characterizations of hypercubes are given: 1) A graph is a hypercube if and only if it is antipodal and bipartite (0, 2)-graph. 2) A graph is an \(n\)-hypercube if and only if there are \(n\) pairs of prime convexes, the graph is a prime convex intersection graph, and each intersection of \(n\) prime convexes (no one of which is from the same pair) is a vertex.

Recommendations

• scientific article; zbMATH DE number 3970798
• A characterization of cube-hypergraphs
• Intersection graphs of maximal hypercubes
• Two characterizations of generalized hypercube
• scientific article; zbMATH DE number 2322

Cited in

(9)

• A generalization of hypercubes: Complemented graphs
• Median graphs and hypercubes, some new characterizations
• A sufficient condition for a bipartite graph to be a cube
• Intersection graphs of maximal hypercubes
• A characterization of cube-hypergraphs
• scientific article; zbMATH DE number 4200277 (Why is no real title available?)
• scientific article; zbMATH DE number 3970798 (Why is no real title available?)
• scientific article; zbMATH DE number 812079 (Why is no real title available?)
• A q-analogous of the characterization of hypercubes as graphs

This page was built for publication: Two characterizations of hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540098)