Results 31 to 40 of about 2,005 (214)
Applications of Strongly Regular Cayley Graphs to Codebooks
IEEE Access, 2023 In this paper, we give a construction of strongly regular Cayley graphs on the finite field $\mathbb {F}_{q^{n}}$ . As applications of these strongly regular Cayley graphs, a class of codebooks is presented and proved to be asymptotically optimal with ...
Qiuyan Wang +3 more
doaj +1 more source
Tạp chí Khoa học Đại học Đà Lạt, 2013 A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k.
Đỗ Như An, Nguyễn Đình Ái
doaj +1 more source
Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$ [PDF]
Transactions on Combinatorics, 2020 In this paper we classify distance-regular graphs, including strongly regular graphs, admitting a transitive action of the linear groups $L(3,2)$, $L(3,3)$, $L(3,4)$ and $L(3,5)$ for which the rank of the permutation representation is at most 15.
Andrea Svob
doaj +1 more source
Higher Order Hamiltonian Systems with Generalized Legendre Transformation
Mathematics, 2018 The aim of this paper is to report some recent results regarding second order Lagrangians corresponding to 2nd and 3rd order Euler–Lagrange forms. The associated 3rd order Hamiltonian systems are found.
Dana Smetanová
doaj +1 more source
On hyperideals of Krasner hyperrings based on derived unitary rings [PDF]
Journal of Mahani Mathematical Research, 2022 In this paper first, we introduce and analyze the strongly regular relations $\lambda^*_{e}$ and $\Lambda^*_{e}$ on a hyperring such that the derived quotient ring is unitary and unitary commutative, respectively. Next, we define and study the notion of $
Seyed Shahin Mousavi +3 more
doaj +1 more source
Distance-Regular Graphs with Strongly Regular Subconstituents [PDF]
Journal of Algebraic Combinatorics, 1997 The main result of the article is a theorem about distance-regular graphs of diameter \(d\geq 3\) with all subconstituents being strongly regular graphs. The author shows that these are precisely the Taylor graphs \((d=3\) and \(|\Gamma_3 (u) |=1)\) or graphs with \(a_1= 0\), \(a_i\leq 1\) for \(2\leq i\leq d\).
openaire +2 more sources
Strongly Semiunits and Tri-Regular Elements in Rings [PDF]
Eurasian Journal of Science and Engineering, 2018 In this paper we study semiunit elements in the group ring Z2G, where G is a cyclic group and we introduce and discuss strongly semiunit elements in Zn, for n=p, 2p, p2 where p is an odd prime.
Parween Ali Hummadi , Suham Hamad Awla
doaj +1 more source
On Strongly F – Regular Modules and Strongly Pure Intersection Property
مجلة بغداد للعلوم, 2014 A submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule
Baghdad Science Journal
doaj +1 more source
Semigroup Forum, 1985 A ring is called strongly regular if its multiplicative semigroup is inverse. This definition is equivalent to more conventional definitions of strongly regular rings [for example, to a definition given by \textit{R. Arens} and \textit{I. Kaplansky}, Trans. Am. Math. Soc. 63, 457-481 (1948; Zbl 0032.00702)].
Schein, B.M., Li, L.
openaire +1 more source
Spreads in strongly regular graphs [PDF]
Designs Codes and Cryptography, 1996 A spread in any geometry is a set of pairwise disjoint lines that cover all the points. For a partial geometry the point graph (collinearity graph) is strongly regular. Delsarte showed that a clique in a strongly regular graph has at most \(K = 1 - k/s\) vertices, where \(k\) and \(s\) are the largest and smallest eigenvalues of the graph respectively.
Haemers, W.H., Touchev, V.D.
openaire +5 more sources