Two characterizations of generalized hypercube

DOI10.1016/0012-365X(91)90217-PzbMath0752.05043MaRDI QIDQ1182875

Michel Mollard

Publication date: 28 June 1992

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

zbMATH Keywords

Hamming graphsgeneralized hypercube

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (4)

Transit sets of -point crossover operators ⋮ Lazy Cops and Robbers on generalized hypercubes ⋮ Distance monotonicity and a new characterization of Hamming graphs ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs

Cites Work

• Unnamed Item
• \((0,\lambda)\)-graphs and \(n\)-cubes
• A q-analogous of the characterization of hypercubes as graphs
• Interval-regular graphs
• Characterization of the Cartesian product of complete graphs by convex subgraphs
• Another characterization of hypercubes
• A characterization of hypercubes
• Algebraic properties of Husimi trees

This page was built for publication: Two characterizations of generalized hypercube