Results 241 to 250 of about 1,945,494 (283)
Prevalence and predictors of computer vision syndrome and ocular surface disease symptoms among adult females in Jordan: A cross-sectional study. [PDF]
Medicine (Baltimore)Abdulmannan DM, Naser AY.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Generalized Strongly Regular Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia, Dongdong +2 more
openaire +4 more sources
Strongly Regular Generalized Equations
Mathematics of Operations Research, 1980This paper considers generalized equations, which are convenient tools for formulating problems in complementarity and in mathematical programming, as well as variational inequalities. We introduce a regularity condition for such problems and, with its help, prove existence, uniqueness and Lipschitz continuity of solutions to generalized equations ...
openaire +2 more sources
2022
Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will ...
Andries E. Brouwer, H. Van Maldeghem
openaire +1 more source
Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will ...
Andries E. Brouwer, H. Van Maldeghem
openaire +1 more source
Star complementary strongly regular decompositions of strongly regular graphs
Linear and Multilinear Algebra, 2019In this paper we consider strongly regular graphs G which admit a decomposition into two strongly regular graphs such that one of them, say H, is a star complement of G.
openaire +1 more source
2011
A graph (simple, undirected, and loopless) of order v is called strongly regular with parameters v, k,λ,μ whenever it is not complete or edgeless.
Andries E. Brouwer, Willem H. Haemers
openaire +1 more source
A graph (simple, undirected, and loopless) of order v is called strongly regular with parameters v, k,λ,μ whenever it is not complete or edgeless.
Andries E. Brouwer, Willem H. Haemers
openaire +1 more source