A characterization of hypercubes

DOI10.1016/0012-365X(77)90145-5MaRDI QIDQ1236550zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3204689 (Why is no real title available?)
• A Note on Undirected Graphs Realizable as P.O. Sets
• Distance-preserving subgraphs of hypercubes
• On cubical graphs
• Undirected Graphs Realizable as Graphs of Modular Lattices

Cited in

(18)

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

This page was built for publication: A characterization of hypercubes

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