AbstractLet CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian group, respectively, of diameter 2 and a given degree d. There is an obvious upper bound of the form CC(d,2)≤AC(d,2)≤d2/2+d+1. We prove a number of lower bounds on both quantities for certain infinite sequences of degrees d related to primes and prime powers, the best being CC(d,2)≥(9/25)(d+3)(d−2) and AC(d,2)≥(3/8)(d2−4). We also offer a result for Cayley graphs of metacyclic groups for general degree and diameter
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
In 1994, Dinneen and Hafner (Networks 24 No. 7, 359–367) published a table of largest orders of grap...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
Let CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian group, res...
AbstractLet CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian gr...
Let CCd,k be the largest possible number of vertices in a cyclic Cayley graph of degree d and diamet...
Let r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a reg-ular graph, a Cayley graph, and a C...
The largest order C(d,k) of a Cayley graph of degree d≥3 and diameter k≥2 cannot exceed the Moore bo...
Abstract. An infinite series and some sporadic examples of large Cayley graphs with given degree and...
AbstractIn this paper we determine new bounds on the maximum number of vertices of a Cayley graph wi...
AbstractLet Cd,k be the largest number of vertices in a Cayley graph of degree d and diameter k. We ...
For a variety of infinite sets of positive integers d related to odd prime powers we describe a simp...
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed pro...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lowe...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
In 1994, Dinneen and Hafner (Networks 24 No. 7, 359–367) published a table of largest orders of grap...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
Let CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian group, res...
AbstractLet CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian gr...
Let CCd,k be the largest possible number of vertices in a cyclic Cayley graph of degree d and diamet...
Let r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a reg-ular graph, a Cayley graph, and a C...
The largest order C(d,k) of a Cayley graph of degree d≥3 and diameter k≥2 cannot exceed the Moore bo...
Abstract. An infinite series and some sporadic examples of large Cayley graphs with given degree and...
AbstractIn this paper we determine new bounds on the maximum number of vertices of a Cayley graph wi...
AbstractLet Cd,k be the largest number of vertices in a Cayley graph of degree d and diameter k. We ...
For a variety of infinite sets of positive integers d related to odd prime powers we describe a simp...
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed pro...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lowe...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
In 1994, Dinneen and Hafner (Networks 24 No. 7, 359–367) published a table of largest orders of grap...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...