| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653853 | European Journal of Combinatorics | 2012 | 17 Pages |
Abstract
We offer the exact solution of the degree–diameter problem for planar graphs in the case of even diameter 2d2d and large degree Δ≥6(12d+1)Δ≥6(12d+1). New graph examples are constructed improving the lower bounds for Δ≥5Δ≥5.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S.A. Tishchenko,