The vertex isoperimetric problem for the powers of the diamond graph

We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the well-studied graphs like hypercubes, grids and tori. In contrast to the mentioned graphs, our graph is not bipartite. We present an exact solution to the vertex isoperimetric problem on our graph by introducing a new class of orders that unifies all known isoperimetric orders defined on the cartesian powers of graphs. Key words: discrete isoperimetric problem; cartesian product; nested solutions;

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Sergei L. Bezrukov, Miquel Rius, Oriol Serra
• Keywords: Cartesian Powers, DM 2008, Isoperimetric, Well-studied Graphs