Optimal Graphs in the Enhanced Mesh Networks
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 th...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2020/9869201 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|