On an isoperimetric problem for Hamming graphs

DOI10.1016/S0166-218X(99)00082-7zbMath0935.05057OpenAlexW2056579989WikidataQ127363158 ScholiaQ127363158MaRDI QIDQ1302164

Lawrence H. Harper

Publication date: 4 May 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00082-7

zbMATH Keywords

Hamming graphproduct of complete graphsvertex-isoperimetric problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Combinatorial inequalities (05A20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (17)

The treewidth and pathwidth of hypercubes ⋮ Planar lattice subsets with minimal vertex boundary ⋮ The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\) ⋮ On the bandwidth of a Hamming graph ⋮ A lower bound for the vertex boundary-width of complete \(k\)-ary trees ⋮ Isoperimetric Problem and Meta-fibonacci Sequences ⋮ Unnamed Item ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ On the variance of Shannon products of graphs ⋮ Isoperimetry in integer lattices ⋮ The sub-Gaussian constant and concentration inequalities ⋮ On the bandwidth of 3-dimensional Hamming graphs ⋮ Maximum rooted connected expansion ⋮ Beating treewidth for average-case subgraph isomorphism ⋮ Bounds on isoperimetric values of trees ⋮ Frankl-Rödl-type theorems for codes and permutations

This page was built for publication: On an isoperimetric problem for Hamming graphs