Characterizing subgraphs of Hamming graphs

DOI10.1002/JGT.20084MaRDI QIDQ5311920zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, Iztok Peterin

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

zbMATH Keywords

Cartesian product of graphsinduced subgraphsisometric subgraphsquotient graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 3966136
• Subdivided graphs as isometric subgraphs of Hamming graphs
• A characterization of the Hamming graph by strongly closed subgraphs
• Isometric subgraphs of Hamming graphs and d-convexity
• Isometric embeddings in Hamming graphs

Cites work

• Geometry of cuts and metrics

Cited in

(27)

• Subdivided graphs as isometric subgraphs of Hamming graphs
• Distance monotonicity and a new characterization of Hamming graphs
• Isometric embeddings in Hamming graphs
• Two characterizations of generalized hypercube
• The retracts of Hamming graphs
• The number of edges in a subgraph of a Hamming graph
• Induced saturation of graphs
• On the complexity of recognizing S-composite and S-prime graphs
• Graphs over graded rings and relation with Hamming graph
• Recognizing Hamming graphs in linear time and space
• Complete k-ary trees and Hamming graphs
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• scientific article; zbMATH DE number 3966136 (Why is no real title available?)
• scientific article; zbMATH DE number 139782 (Why is no real title available?)
• scientific article; zbMATH DE number 524148 (Why is no real title available?)
• Cayley graphs of graded rings
• Isometric subgraphs of Hamming graphs and d-convexity
• Induced embeddings into Hamming graphs
• Betweenness centrality in Cartesian product of graphs
• A survey and classification of Sierpiński-type graphs
• Partial Hamming graphs and expansion procedures
• An induced subgraph of the Hamming graph with maximum degree 1
• Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
• Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
• Hamming dimension of a graph-the case of Sierpiński graphs
• Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
• A characterization of the Hamming graph by strongly closed subgraphs

This page was built for publication: Characterizing subgraphs of Hamming graphs

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