Results 261 to 270 of about 29,610 (306)
Calycosin suppresses the activating effect of granulocyte-macrophage-colony-stimulating factor-producing T helper cells on macrophages in experimental atherosclerosis. [PDF]
Front PharmacolXiong X +5 more
europepmc +1 more source
The impact of practical training based on narrative nursing on the humanistic care ability of Chinese intern nurses. [PDF]
Front Med (Lausanne)Dai L +5 more
europepmc +1 more source
Trust and class aware service discovery with dual control in the social Internet of Things. [PDF]
Sci RepRehman A +5 more
europepmc +1 more source
Extracellular stimulation and ephaptic coupling of neurons in a fully coupled finite element-based Extracellular-Membrane-Intracellular (EMI) model. [PDF]
Front Comput NeurosciJæger KH, Tveito A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
On Generalized Strongly Regular Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia, Dongdong +2 more
openaire +2 more sources