Results 11 to 20 of about 418,956 (263)
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
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 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
On strongly regular bicirculants
European Journal of Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksander Malnic +2 more
openaire +3 more sources
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
Extension of Strongly Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 The Friendship Theorem states that if any two people in a party have exactly one common friend, then there exists a politician who is a friend of everybody. In this paper, we generalize the Friendship Theorem. Let $\lambda$ be any nonnegative integer and $\mu$ be any positive integer.
Gera, Ralucca, Shen, J.
openaire +5 more sources
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
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
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Ural Mathematical Journal, 2018 Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
doaj +1 more source
Regular equivalence and strongly regular equivalence on multiplicative ternary hyperring [PDF]
Journal of Hyperstructures, 2015 We introduce the notion of a multiplicative ternary hyperring, consider regular equivalences and strongly regular equivalences of a multiplicative ternary hyperring and investigate their properties.
Md Salim Masud Molla +2 more
doaj +1 more source