Results 21 to 30 of about 2,811,422 (296)
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
On the Integrability of Strongly Regular Graphs [PDF]
Graphs and Combinatorics, 2019 Koolen et al. showed that if a connected graph with smallest eigenvalue at least $-3$ has large minimal valency, then it is $2$-integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.
Jack H. Koolen +2 more
openaire +3 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
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
Ural Mathematical Journal, 2017 Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with \(\lambda=\mu\).
Konstantin S. Efimov +1 more
doaj +1 more source
Weakly and Strongly Irreversible Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages ...
Giovanna J. Lavado +2 more
doaj +1 more source
Regular star complements in strongly regular graphs [PDF]
, 2012 We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s∈N.
Peter Rowlinson, Rowlinson, Peter
core +1 more source
The Connectivity of Strongly Regular Graphs
European Journal of Combinatorics, 1985 Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.
A.E. Brouwer (Andries), D.M. Mesner
openaire +4 more sources
The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$ [PDF]
E-Journal of Analysis and Applied MathematicsThe existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper, we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$.
Reimbay Reimbayev
doaj +1 more source
SOME RESULTS ON STRONGLY π-REGULAR RIN
Tikrit Journal of Pure Science, 2023 In this paper we study the strongly - regular ring (for short st. -reg. rg.) and some properties also give some new results of st. -reg. rg. and its connection with other rings.
Sinan O. Al-Salihi, Emad I. Jassim
doaj +1 more source