Characterizing subgraphs of Hamming graphs
From MaRDI portal
Publication:5311920
DOI10.1002/jgt.20084zbMath1068.05058OpenAlexW4229951251MaRDI QIDQ5311920
Publication date: 29 August 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20084
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (11)
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs ⋮ Betweenness centrality in Cartesian product of graphs ⋮ Cayley graphs of graded rings ⋮ Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum ⋮ On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs ⋮ Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime ⋮ Induced saturation of graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs over graded rings and relation with Hamming graph ⋮ Subdivided graphs as isometric subgraphs of Hamming graphs ⋮ Induced Embeddings into Hamming Graphs.
Cites Work
This page was built for publication: Characterizing subgraphs of Hamming graphs
