The number of edges in a subgraph of a Hamming graph

DOI10.1016/S0893-9659(01)80030-6MaRDI QIDQ1600356zbMATH OpenWikidataFDO

Authors R. Squier, Andrew Vogt, Bruce Torrence

Publication date 13 June 2002

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0893-9659(01)80030-6

zbMATH Keywords

Cartesian productdecomposableHamming graphsizesubgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Characterizing subgraphs of Hamming graphs
• An induced subgraph of the Hamming graph with maximum degree 1
• Subgraphs intersecting any Hamiltonian cycle
• The edge-diametric theorem in Hamming spaces
• On the number of homogeneous subgraphs of a graph

Cites work

• Distance-preserving subgraphs of hypercubes
• Embedding Trees in a Hypercube is NP-Complete
• Isometric embeddings in Hamming graphs
• On cubical graphs
• On induced subgraphs of the cube
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• Parallel concepts in graph theory

Cited in

(4)

• On the number of all substructures containing at most four edges
• Crux and Long Cycles in Graphs
• An induced subgraph of the Hamming graph with maximum degree 1
• Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph

This page was built for publication: The number of edges in a subgraph of a Hamming graph

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