The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some restrictions on the valency and the diameter of the graph. The restriction on the valency of the graph does not impose any condition on the number of edges (apart from taking the graph simple), so the resulting graph may be thought of as being embedded in the complete graph. In a generality of the said problem, the graph is taken to be embedded in any connected host graph. In this article, host graph is considered as the enhanced mesh network constructed from the grid network. This article provides some exact values for the said problem and also gives some bounds for the optimal graphs.

中文翻译：

---

增强网状网络中的最优图

度直径问题探索最大的图（以节点数为单位），但该图的价数和直径受到一些限制。对图的价态的限制不对边的数量施加任何条件（除了使图简单），因此可以将结果图视为嵌入在完整图中。一般说来，所述问题被认为是嵌入在任何连接的主图中。在本文中，主机图被视为从网格网络构建的增强型网格网络。本文为上述问题提供了一些确切的值，并为最佳图形提供了一些界限。