Xiang, QingGauss sums play an important role in the construction of strongly regular Cayley graphs and association schemes. Compared with other approaches to the constructions of strongly regular graphs, the method using Gauss sums requires a lot of background knowledge from algebra and number theory. In [50], Schmidt and White provided a conjecture on cyclotomic strongly regular graphs which contains 11 sporadic examples of cyclotomic strongly regular graphs. We rst generalize one of their sporadic examples to an innite family of strongly regular graphs by using a union of cyclotomic classes. We do so by rst deriving expressions for the (restricted) eigenvalues of Cayley graphs without evaluating Gauss sums explicitly, and then giving cond...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
Let q be a prime power, Fq be the finite field of order q, and F∗q = Fq \ {0}. Let D be a subset of ...
AbstractWe give two constructions of strongly regular Cayley graphs on finite fields Fq by using uni...
AbstractWe give two constructions of strongly regular Cayley graphs on finite fields Fq by using uni...
AbstractIn this paper, we give a construction of an amorphous association scheme from a pseudo-cycli...
AbstractLet X be a pseudocyclic association scheme in which all the nontrivial relations are strongl...
AbstractWe give an overview of results on amorphic association schemes. We give the known constructi...
We report about the results of the application of modern computer algebra tools for construction of ...
この論文では, 3つの値を取るガウス周期の新しい系列を発見するとともに, それに基づく強正則ケーリーグラフの新たな構成法を与える. 特に, 今回得られた結果は, [3]の結果のある種の一般化としてみな...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AMS classifications: 05E30, 05B20;amorphic association scheme;strongly regular graph;(negative) Lati...
E. R. van Dam gave an example of primitive non-amorphous association schemes in which every nontri...
E. R. van Dam gave an example of primitive non-amorphous association schemes in which every nontri...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
Let q be a prime power, Fq be the finite field of order q, and F∗q = Fq \ {0}. Let D be a subset of ...
AbstractWe give two constructions of strongly regular Cayley graphs on finite fields Fq by using uni...
AbstractWe give two constructions of strongly regular Cayley graphs on finite fields Fq by using uni...
AbstractIn this paper, we give a construction of an amorphous association scheme from a pseudo-cycli...
AbstractLet X be a pseudocyclic association scheme in which all the nontrivial relations are strongl...
AbstractWe give an overview of results on amorphic association schemes. We give the known constructi...
We report about the results of the application of modern computer algebra tools for construction of ...
この論文では, 3つの値を取るガウス周期の新しい系列を発見するとともに, それに基づく強正則ケーリーグラフの新たな構成法を与える. 特に, 今回得られた結果は, [3]の結果のある種の一般化としてみな...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AMS classifications: 05E30, 05B20;amorphic association scheme;strongly regular graph;(negative) Lati...
E. R. van Dam gave an example of primitive non-amorphous association schemes in which every nontri...
E. R. van Dam gave an example of primitive non-amorphous association schemes in which every nontri...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...