Results 11 to 20 of about 2,005 (214)
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
Ural Mathematical Journal, 2022 For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph ...
Alexander A. Makhnev +2 more
doaj +1 more source
Al-Rafidain Journal of Computer Sciences and Mathematics, 2014 A ring R is called local ring if it has exactly one maximal ideal. In this paper, we introduce some characterization and basic properties of this ring. Also, we studied the relation between local rings and Von Neumann regular rings and strongly regular ...
Zubayda Ibraheem, Anees Fthee
doaj +1 more source
Strongly Regular Graphs Having Strongly Regular Subconstituents
Journal of Algebra, 1978 No abstract.
Cameron, P.J. +2 more
openaire +2 more sources
Al-Rafidain Journal of Computer Sciences and Mathematics, 2014 As a generalization of right pure ideals, we introduce the notion of right П – pure ideals. A right ideal I of R is said to be П – pure, if for every a Î I there exists b Î I and a positive integer n such that an ≠ 0 and an b = an.
Shaimaa Ahmad
doaj +1 more source
On strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 7/2, 7/3, 7/4, 7/5, 7/6 [PDF]
Yugoslav Journal of Operations Research, 2021 We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is strongly regular if there exist non-negative integers τ and θ such that |Si ∩ Sj| = τ for any two adjacent vertices i and j, and |Si ∩ Sj| = θ for any
Lepović Mirko
doaj +1 more source
Approximately strongly regular graphs
Discrete Mathematics, 2023 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
Strongly regular relations on regular hypergroups [PDF]
Journal of Mahani Mathematical ResearchHypergroups that have at least one identity element and where each element has at least one inverse are called regular hypergroup. In this regards, for a regular hypergroup $H$, it is shown that there exists a correspondence between the set of all ...
Reza Ameri, Behnam Afshar
doaj +1 more source
D-magic strongly regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +1 more source
Al-Rafidain Journal of Computer Sciences and Mathematics, 2020 An ideal I of a ring R is said to be right (left) Pure if for every , there is such that . A ring R is said to be right (left) MP-ring, if every maximal right (left) ideal of R is a left (right) pure.
Raida Mahmood, Azhar Hajo
doaj +1 more source
Strongly regular graphs with strongly regular decomposition
Linear Algebra and its Applications, 1989 Partitions of strongly regular graphs into two strongly regular subgraphs are studied. Such partitions give rise to quasi-symmetric designs and other types of interesting configurations. Necessary conditions for the existence of such partitions are derived. Several constructions are given and a table of all feasible parameter sets up to 300 vertices is
Haemers, W. H., Higman, Donald G.
openaire +2 more sources