اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn strongly walk regular graphs, triple sum sets and their codes
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Strongly walk-regular graphs can be constructed as coset graphs of the duals of projective three-weight codes whose weights satisfy a certain equation. We provide classifications of the feasible parameters in the binary and ternary case for medium size code lengths. Additionally some theoretical insights on the properties of the feasible parameters are presented.
قيم البحث
اقرأ أيضاً
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.
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 survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on difference sets rel
ated to cyclotomy, and cyclotomic constructions of sequences with low correlation. We also give an extensive survey of recent results on constructions of strongly regular Cayley graphs and related geometric substructures such as $m$-ovoids and $i$-tight sets in classical polar spaces.
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $iin{1,ldots,u}$ of binary (respectively, extended binary) Hamming co
des of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest eigenvalues, th
e minimum of second-smallest eigenvalues of Laplacian matrices and hence the maximum of Laplacian spreads among all simple connected graphs of fixed order, minimum degree, maximum degree, minimum size of common neighbors of two adjacent vertices and minimum size of common neighbors of two nonadjacent vertices. Some other extremal graphs are also provided.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
