Let BCd,k be the largest possible number of vertices in a bipartite Cayley graph of degree d and diameter k. We show that BCd,k≥2(k−1)((d−4)/3)k−1 for any d≥6 and any even k≥4, and BCd,k≥(k−1)((d−2)/3)k−1 for d≥6 and k≥7 such that k≡3 (mod 4).
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage PlusPublished in last 50 years