Improved lower bounds on the degree–diameter problem
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Algebraic Combinatorics"
DOI: 10.1007/s10801-018-0822-6
Abstract: Let C(d, k) and AC(d, k) be the largest order of a Cayley graph and a Cayley graph based on an abelian group, respectively, of degree d and diameter k. It is well known that $$C(d,k)\le 1+d+d(d-1)+\cdots… read more here.
Keywords: degree diameter; graph; diameter problem; frac ... See more keywords