论文信息 - The vertex isoperimetric problem for the powers of the diamond graph

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.

Oriol Serra | Sergei L. Bezrukov | Miquel Rius

[1] Oliver Riordan. An Ordering on the Even Discrete Torus , 1998, SIAM J. Discret. Math..

[2] Béla Bollobás,et al. Isoperimetric inequalities and fractional set systems , 1991, J. Comb. Theory, Ser. A.

[3] Da-Lun Wang,et al. Extremal Configurations on a Discrete Torus and a Generalization of the Generalized Macaulay Theorem , 1977 .

[4] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .

[5] S. Bezrukov. Edge Isoperimetric Problems on Graphs , 2007 .

[6] JOSEP DÍAZ,et al. A survey of graph layout problems , 2002, CSUR.

[7] Oriol Serra,et al. A local-global principle for vertex-isoperimetric problems , 2002, Discret. Math..

[8] Sergei L. Bezrukov,et al. Macaulay Posets , .

[9] Sergei L. Bezrukov,et al. A new approach to Macaulay posets , 2004, J. Comb. Theory, Ser. A.

[10] Da-Lun Wang,et al. Discrete Isoperimetric Problems , 1977 .

[11] Thomas A. Carlson. The edge-isoperimetric problem for discrete tori , 2002, Discret. Math..

[12] K. Engel. Sperner Theory , 1996 .