Cyclotomy and Strongly Regular Graphs
نویسندگان
چکیده
We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic classes as difference set. Several new examples are found.
منابع مشابه
Cyclotomy, Gauss Sums, Difference Sets and Strongly Regular Cayley Graphs
We survey recent results on constructions of difference sets and strongly regular Cayley graphs by using union of cyclotomic classes of finite fields. Several open problems are raised.
متن کاملGeneralizations of Partial Difference Sets from Cyclotomy to Nonelementary Abelian p-Groups
A partial difference set having parameters (n2, r(n − 1), n + r2 − 3r, r2 − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n2, r(n + 1),−n + r2 + 3r, r2 + r) is called a negative Latin square type partial difference set. In this paper, we generalize well-known negative Latin square type partial difference sets derived from the theory o...
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملPARTIAL DIFFERENCE SETS FROM p-ARY WEAKLY REGULAR BENT FUNCTIONS AND QUADRATIC FORMS
We generalize the construction of affine polar graphs in two different ways to obtain partial difference sets and amorphic association schemes. In the first generalization we replace the quadratic form in the affine polar graph construction by higher degree homogeneous functions that are p-ary weakly regular bent. The second generalization uses a combination of quadratic forms and uniform cyclo...
متن کاملStrongly walk - regular grapsh
We study a generalization of strongly regular graphs. We call a graph strongly walkregular if there is an ` > 1 such that the number of walks of length ` from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. We will show that a strongly walk-regular graph must be an empty graph, a complete graph, a strongly regular graph, a disjoint un...
متن کامل