Optimal Graphs in the Enhanced Mesh Networks

الملخص EN

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.