Results 201 to 210 of about 8,040,567 (219)
Transfer learning enhances clinical utility of polygenic scores with small, phenotypically refined cohorts. [PDF]
Genome ResLin Y +20 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes
Journal of Applied Mathematics and ComputingHamidreza Maimani +1 more
exaly +4 more sources
The Zero Forcing Number of Graphs
SIAM Journal on Discrete Mathematics, 2019 A subset S of initially infected vertices of a graph G is called zero forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbor, infects this neighbor.
Thomas Kalinowski +2 more
exaly +2 more sources
Positive semidefinite zero forcing [PDF]
Linear Algebra and Its Applications, 2013 The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish a variety of properties of Z+(G): Any vertex of G can be in a minimum positive semidefinite zero forcing set (this is not true for standard zero forcing).
Craig Erickson +2 more
exaly +1 more source
Fractional zero forcing via three-color forcing games [PDF]
Discrete Applied Mathematics, 2016 An r-fold analogue of the positive semidefinite zero forcing process that is carried out on the r-blowup of a graph is introduced and used to define the fractional positive semidefinite forcing number.
David Robérson +2 more
exaly +1 more source
Reconfiguration graphs of zero forcing sets
Discrete Applied Mathematics, 2023Leslie Hogben +2 more
exaly
An Inverse Approach for Finding Graphs with a Failed Zero Forcing Number of k
Mathematics, 2023exaly