A characterization of hypercubes

DOI10.1016/0012-365X(77)90145-5zbMath0354.05045MaRDI QIDQ1236550

K. Appert

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Partial orders, general (06A06) Factorials, binomial coefficients, combinatorial functions (05A10) Structure theory of lattices (06B05) Graph theory (05C99)

Related Items (18)

Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes ⋮ A survey of the theory of hypercube graphs ⋮ A characterization of cube-hypergraphs ⋮ On the complexity of testing a graph for n-cube ⋮ Rigidity properties of the hypercube via Bakry-Émery curvature ⋮ Another characterization of hypercubes ⋮ On super connectivity of Cartesian product graphs ⋮ A graph theoretic approach to switching function minimization ⋮ On the properties of arbitrary hypercubes ⋮ Two characterizations of generalized hypercube ⋮ Interval-regularity does not lead to interval monotonicity ⋮ Betweenness centrality in some classes of graphs ⋮ On \(F\)-geodetic graphs ⋮ \((0,\lambda)\)-graphs and \(n\)-cubes ⋮ A q-analogous of the characterization of hypercubes as graphs ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Interval-regular graphs ⋮ Optimal gray-code labeling and recognition algorithms for hypercubes

Cites Work

• Unnamed Item
• On cubical graphs
• Distance-preserving subgraphs of hypercubes
• Undirected Graphs Realizable as Graphs of Modular Lattices
• A Note on Undirected Graphs Realizable as P.O. Sets

This page was built for publication: A characterization of hypercubes