Distance regular subgraphs of a cube

DOI10.1016/0012-365X(92)90300-5zbMath0782.05029OpenAlexW6880063MaRDI QIDQ686314

Paul M. Weichsel

Publication date: 14 October 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90300-5

zbMATH Keywords

Cayley graphisometric embeddings\(n\)-dimensional cubedistance regular graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (12)

There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Weighted efficient domination problem on some perfect graphs ⋮ Efficient domination through eigenvalues ⋮ Structure of squares and efficient domination in graph classes ⋮ Modelling and solving the perfect edge domination problem ⋮ Hypercube embeddings and Cayley graphs generated by transpositions ⋮ Characterizing graphs with fully positive semidefinite \(Q\)-matrices ⋮ Cubic inflation, mirror graphs, regular maps, and partial cubes ⋮ Distance regularity in direct-product graphs ⋮ On subgraphs in distance-regular graphs ⋮ Characterization of 2-arc-transitive partial cubes ⋮ \(\ell_ 1\)-rigid graphs

Cites Work

• Unnamed Item
• On cubical graphs
• Distance-preserving subgraphs of hypercubes
• Hypermetric Spaces and the Hamming Cone

This page was built for publication: Distance regular subgraphs of a cube