The bisection width and the isoperimetric number of arrays.

DOI10.1016/S0166-218X(03)00265-8zbMath1050.05069OpenAlexW2067342608MaRDI QIDQ1428547

M. Cemil Azizoğlu, Ömer Eğecioğlu

Publication date: 29 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00265-8

zbMATH Keywords

Hamming graphisoperimetric numberproduct grapharraybisection widthextremal set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

A survey of the modified Moran process and evolutionary graph theory, Cops and Robber game with a fast robber on expander graphs and random graphs, The bisection width and the isoperimetric number of arrays., Absorption time of the Moran process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The bisection width and the isoperimetric number of arrays.
• Isoperimetric numbers of graphs
• Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs
• THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS