| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653288 | European Journal of Combinatorics | 2016 | 12 Pages |
Abstract
It is known that the number of vertices of a graph of diameter two cannot exceed d2+1d2+1. In this contribution we give a new lower bound for orders of Cayley graphs of diameter two in the form C(d,2)>0.684d2C(d,2)>0.684d2 valid for all degrees d≥360756. The result is a significant improvement of currently known results on the orders of Cayley graphs of diameter two.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Marcel Abas,