Results 31 to 40 of about 418,956 (263)
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
Approximately strongly regular graphs
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to extremal problems. Among other things, we show the following: (1) Caps in $\mathrm{PG}(n, q)$ for which the number of
openaire +3 more sources
Higher Order Hamiltonian Systems with Generalized Legendre Transformation
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
Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$ [PDF]
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
Strongly Semiunits and Tri-Regular Elements in Rings [PDF]
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
Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
openaire +4 more sources
In our study we examine definition of strongly γ -regular rings and associates, investigate interplay between strongly γ - regular rings and other reduced rings. We also study GP – injective modules, and discuss its relation with strongly
Luma Ahmed Khaleel, Beyda S. Abdullah
doaj +1 more source
On Strongly F – Regular Modules and Strongly Pure Intersection Property
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
Cyclotomy and Strongly Regular Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E. +2 more
openaire +3 more sources
A new strongly regular graph with parameters (81,30,9,12) is found as a graph invariant under certain subgroup of the full automorphism group of the previously known strongly regular graph discovered in 1981 by J. H. van Lint and A. Schrijver.
Dean Crnković, Andrea Švob
doaj +1 more source

