MaxDDBS in the mesh

The mesh as host graph
An important special case is when the host graph G is a common parallel architecture, such as the mesh, the hypercube, the butterfly, etc. The paper by Miller, Perez-Roses, and Ryan (2011) computes upper and lower bounds for the largest subgraph of the mesh in arbitrary dimension. Moreover, it discusses the cases of degree 4 in dimension 3, and degree 3 in dimension 2, where some general constructions are given, that are asymptotically optimal.

Back to MaxDDBS

Subgraphs of degree 3 in the 2-dimensional mesh
If we take an infinite 2-dimensional mesh as a host graph, then the only case that makes sense is d=3. In this case, the upper bound for the order of the largest subgraph is:


 * $$ 2p^2 + 2p +1 $$, if k is even, and
 * $$ 2p^2 + 4p +2 $$, if k is odd,

where $$ p = \lfloor k/2 \rfloor $$.

The paper by Miller, Perez-Roses and Ryan (2011) gives general constructions for this case, that come asymptotically close to the upper bounds. However, for particular values of the diameter, the constructions do not provide the largest known subgraphs. Here we maintain a list of the largest known subgraphs of degree 3 for some small values of the diameter k.

The following table gives the order of the largest known subgraphs. If you can beat any of these constructions, please get in contact with the [mailto:hebert.perez@gmail.com moderator] in order to include your graph:

Next is the table with the color codes:

And the actual graphs are shown here:

Diameters 2, 3, 4:



Diameter 5:



Diameter 6:



Diameter 7:



Diameter 8:



Diameter 9:



Diameter 10:



Diameter 11:



Diameter 12:



Diameter 13:



Diameter 14:



Diameter 15:



Diameter 16: