Add to ORKGAn infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
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...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having ...
AbstractLet Cd,k be the largest number of vertices in a Cayley graph of degree d and diameter k. We ...
AbstractIn this paper we determine new bounds on the maximum number of vertices of a Cayley graph wi...
The largest order n(d,k) of a graph of maximum degree d and diameter k cannot exceed the Moore bound...
AbstractLet CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian gr...
AbstractLet BCd,k be the largest possible number of vertices in a bipartite Cayley graph of degree d...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
AbstractIn this note we obtain a simple expression of any finite group by means of its generating se...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
For a variety of infinite sets of positive integers d related to odd prime powers we describe a simp...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
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...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having ...
AbstractLet Cd,k be the largest number of vertices in a Cayley graph of degree d and diameter k. We ...
AbstractIn this paper we determine new bounds on the maximum number of vertices of a Cayley graph wi...
The largest order n(d,k) of a graph of maximum degree d and diameter k cannot exceed the Moore bound...
AbstractLet CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian gr...
AbstractLet BCd,k be the largest possible number of vertices in a bipartite Cayley graph of degree d...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
AbstractIn this note we obtain a simple expression of any finite group by means of its generating se...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
For a variety of infinite sets of positive integers d related to odd prime powers we describe a simp...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
AbstractFor a variety of infinite sets of positive integers d related to odd prime powers we describ...
The largest order C(d,k) of a Cayley graph of degree d≥3 and diameter k≥2 cannot exceed the Moore bo...