اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConstructions of Strongly Regular Cayley Graphs Using Index Four Gauss Sums
120
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a construction of strongly regular Cayley graphs on finite fields $F_q$ by using union of cyclotomic classes and index 4 Gauss sums. In particular, we obtain two infinite families of strongly regular graphs with new parameters.
قيم البحث
اقرأ أيضاً
Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which played an i
mportant role in the theory. On the other hand, Polhill (2010) gave a construction of Paley type partial difference sets (conference graphs) based on a special system of building blocks, called a covering extended building set, and proved that there exists a Paley type partial difference set in an abelian group of order $9^iv^4$ for any odd positive integer $v>1$ and any $i=0,1$. His result covers all orders of nonelementary abelian groups in which Paley type partial difference sets exist. In this paper, we give new constructions of strongly regular Cayley graphs on abelian groups by extending the theory of building blocks. The constructions are large generalizations of Polhills construction. In particular, we show that for a positive integer $m$ and elementary abelian groups $G_i$, $i=1,2,ldots,s$, of order $q_i^4$ such that $2m,|,q_i+1$, there exists a decomposition of the complete graph on the abelian group $G=G_1times G_2times cdotstimes G_s$ by strongly regular Cayley graphs with negative Latin square type parameters $(u^2,c(u+1),- u+c^2+3 c,c^2+ c)$, where $u=q_1^2q_2^2cdots q_s^2$ and $c=(u-1)/m$. Such strongly regular decompositions were previously known only when $m=2$ or $G$ is a $p$-group. Moreover, we find one more new infinite family of decompositions of the complete graphs by Latin square type strongly regular Cayley graphs. Thus, we obtain many strongly regular graphs with new parameters.
In this paper, we give a construction of strongly regular Cayley graphs on the additive groups of finite fields based on three-valued Gauss periods. As consequences, we obtain two infinite families and one sporadic example of new strongly regular Cay
ley graphs. This construction can be viewed as a generalization of that of strongly regular Cayley graphs obtained in cite{BLMX}.
In this paper, we give a construction of strongly regular Cayley graphs and a construction of skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and they generalize the constructions given by
Feng and Xiang cite{FX111,FX113}. Three infinite families of strongly regular graphs with new parameters are obtained. The main tools that we employed are index 2 Gauss sums, instead of cyclotomic numbers.
In this paper, we give a new lifting construction of hyperbolic type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of subdifference se
ts of the Singer difference sets. Our results unify some recent constructions of strongly regular Cayley graphs related to $m$-ovoids and $i$-tight sets in finite geometry. Furthermore, some of the strongly regular Cayley graphs obtained in this paper are new or nonisomorphic to known strongly regular graphs with the same parameters.
We prove an upper bound on the number of pairwise strongly cospectral vertices in a normal Cayley graph, in terms of the multiplicities of its eigenvalues. We use this to determine an explicit bound in Cayley graphs of $mathbb{Z}_2^d$ and $mathbb{Z}_
4^d$. We also provide some infinite families of Cayley graphs of $mathbb{Z}_2^d$ with a set of four pairwise strongly cospectral vertices and show that such graphs exist in every dimension.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
