iv The Degree/Diameter problem has been studied for a long time and still have’t been solved completely.We take a whole analysis on it and give two main solutions to it in this paper.One is through constructing a Cayley graph on the semi-product of two cyclic groups,another is by lifting a small base graph G in a cyclic group Znp through a voltage assignment α.We focus on the fundamental theory and computing steps of the two methods,and give an example for each. By building the relation among diameter,eigenvalue and degree of a regular graph,we got a so-called Eigenvalue-Δ Bound compared famous Moore Bound. Sur-prisingly,the Eigenvalue-Δ Bound is equal to the Moore Bound for all the cases with diameter 2.Along the method,we discussed all th...
AbstractLet CC(d,2) and AC(d,2) be the largest order of a Cayley graph of a cyclic and an Abelian gr...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
This paper discusses the most popular algebraic techniques and computational methods that have been...
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed prop...
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed pro...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
In 1994, Dinneen and Hafner (Networks 24 No. 7, 359–367) published a table of largest orders of grap...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The largest order C(d,k) of a Cayley graph of degree d≥3 and diameter k≥2 cannot exceed the Moore bo...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
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...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
This paper discusses the most popular algebraic techniques and computational methods that have been...
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed prop...
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed pro...
The order of a graph of maximum degree d and diameter 2 cannot exceed d 2+1, the Moore bound for dia...
AbstractThe order of a graph of maximum degree d and diameter 2 cannot exceed d2+1, the Moore bound ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
In 1994, Dinneen and Hafner (Networks 24 No. 7, 359–367) published a table of largest orders of grap...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The largest order C(d,k) of a Cayley graph of degree d≥3 and diameter k≥2 cannot exceed the Moore bo...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
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...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
This paper discusses the most popular algebraic techniques and computational methods that have been...